153
click to vote
ALGORITHMICA
2011
14 years 10 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...