The following pages link to Crossing Number is NP-Complete (Q3320398):
Displaying 50 items.
- A faster fixed parameter algorithm for two-layer crossing minimization (Q284334) (← links)
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- The crossing number of chordal ring networks (Q313472) (← links)
- On drawings and decompositions of 1-planar graphs (Q396768) (← links)
- A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (Q411236) (← links)
- Planar crossing numbers of graphs of bounded genus (Q452001) (← links)
- MSOL restricted contractibility to planar graphs (Q527397) (← links)
- On the red/blue spanning tree problem (Q534557) (← links)
- Crossing numbers of graphs with rotation systems (Q548653) (← links)
- Crossing number and weighted crossing number of near-planar graphs (Q548655) (← links)
- On crossing numbers of geometric proximity graphs (Q632725) (← links)
- Vertex insertion approximates the crossing number of apex graphs (Q661940) (← links)
- Bound for the 2-page fixed linear crossing number of hypercube graph via SDP relaxation (Q670454) (← links)
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation (Q714020) (← links)
- A linear edge kernel for two-layer crossing minimization (Q744090) (← links)
- On the crossing number of complete graphs (Q817025) (← links)
- The complexity of power indexes with graph restricted coalitions (Q898757) (← 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)
- Analogies between the crossing number and the tangle crossing number (Q1627199) (← links)
- Heuristics for the constrained incremental graph drawing problem (Q1634310) (← links)
- Tabu search for the dynamic bipartite drawing problem (Q1652530) (← links)
- The crossing number of locally twisted cubes \(L T Q_n\) (Q1671371) (← links)
- Variable neighborhood descent for the incremental graph drawing (Q1687677) (← links)
- Variable neighborhood scatter search for the incremental graph drawing problem (Q1694406) (← links)
- 1-fan-bundle-planar drawings of graphs (Q1708027) (← links)
- The crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycle (Q1708383) (← links)
- The crossing number of the hexagonal graph \(H_{3,n}\) (Q1717209) (← links)
- Crossing numbers and stress of random graphs (Q1725756) (← links)
