The following pages link to Crossing Number is NP-Complete (Q3320398):
Displayed 11 items.
- On Canonical Concurrent Flows, Crossing Number and Graph Expansion (Q4325335) (← links)
- (Q4789076) (← links)
- Genetic algorithms for drawing bipartite graphs (Q4844579) (← links)
- Enumerations of the maximum rectilinear crossing numbers of complete and complete multi-partite graphs (Q5307758) (← links)
- Approximating the Crossing Number of Toroidal Graphs (Q5387753) (← links)
- Crossing Number of Graphs with Rotation Systems (Q5452204) (← links)
- (Q5708499) (← links)
- Experiments on drawing 2-level hierarchical graphs (Q5895402) (← links)
- Experiments on drawing 2-level hierarchical graphs (Q5899817) (← links)
- Recognizing string graphs in NP (Q5917583) (← links)
- Approximation algorithms for minimizing edge crossings in radial drawings (Q5961979) (← links)