Crossing Number is NP-Complete
- 1 September 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 4 (3), 312-316
- https://doi.org/10.1137/0604033
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Efficient Planarity TestingJournal of the ACM, 1974
- Topology of Thin Film RC CircuitsBell System Technical Journal, 1966