The following pages link to Crossing Number is NP-Complete (Q3320398):
Displayed 50 items.
- On the crossing number of complete graphs (Q817025) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Randomized priority algorithms (Q974749) (← links)
- The crossing number of \(K_{1,m,n}\) (Q998333) (← links)
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints (Q1002106) (← links)
- On the complexity of crossings in permutations (Q1011761) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- The crossing number of \(C(8,2)\square P_{n}\) (Q1015432) (← links)
- Threshold and complexity results for the cover pebbling game (Q1025557) (← links)
- The crossing numbers of generalized Petersen graphs with small order (Q1028429) (← links)
- An evolutionary formulation of the crossing number problem (Q1040098) (← links)
- Crossing minimization in weighted bipartite graphs (Q1044030) (← links)
- Graph graphics: Theory and practice (Q1103411) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Some provably hard crossing number problems (Q1176321) (← links)
- Graph layout for applications in compiler construction (Q1285776) (← links)
- Edge crossings in drawings of bipartite graphs (Q1322570) (← links)
- Drawing graphs in two layers (Q1331939) (← links)
- The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings (Q1350939) (← links)
- ARC crossing minimization in hierarchical digraphs with tabu search (Q1373159) (← links)
- Crossing-number critical graphs have bounded path-width (Q1400969) (← links)
- A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
- A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
- The crossing number of \(C(n; \{1,3\})\) (Q1763340) (← links)
- On the one-sided crossing minimization in a bipartite graph with large degrees (Q1770400) (← links)
- Which crossing number is it anyway? (Q1850498) (← links)
- New bounds on the barycenter heuristic for bipartite graph drawing. (Q1853018) (← links)
- Decidability of string graphs (Q1887714) (← links)
- NETPAD: An interactive graphics system for network modeling and optimization (Q1904615) (← links)
- Drawings of graphs on surfaces with few crossings (Q1920424) (← links)
- Crossing-constrained hierarchical drawings (Q2458930) (← links)
- The crossing number of \(C(3k+1;\{1,k\})\) (Q2461203) (← links)
- The crossing number of \(K_{1,4,n}\) (Q2477388) (← links)
- The crossing number of Cartesian products of complete bipartite graphs \(K_{2,m}\) with paths \(P_{n}\) (Q2478173) (← links)
- Odd crossing number and crossing number are not the same (Q2482214) (← links)
- Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm (Q2491331) (← links)
- Crossing number is hard for cubic graphs (Q2496198) (← links)
- On maximum planar induced subgraphs (Q2500525) (← links)
- Orthogonal drawings of graphs with vertex and edge labels (Q2573336) (← links)
- (Q2741531) (← links)
- (Q2777504) (← links)
- On the Minimum Cut of Planarizations (Q3439582) (← links)
- How to draw a hypergraph (Q3477978) (← links)
- Obtaining a Planar Graph by Vertex Deletion (Q3508576) (← links)
- An improved upper bound on the crossing number of the hypercube (Q3605145) (← links)
- Crossing and Weighted Crossing Number of Near-Planar Graphs (Q3611835) (← links)
- The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
- Bipartite Graph Representation of Multiple Decision Table Classifiers (Q3646117) (← links)
- Menus of kuratowski subgraphs (Q3801576) (← links)