Johnson, David S. The NP-completeness column: An ongoing guide. III. (English) Zbl 0494.68049 J. Algorithms 3, 182-195 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 22 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 00A07 Problem books Keywords:NP-completeness; graph isomorphism; subgraph homeomorphism; graph genus; chromatic index; spanning tree parity; 3-processor scheduling; total unimodularity; composite number; minimum-length triangulation; imperfect graph; NP-complete problems PDF BibTeX XML Cite \textit{D. S. Johnson}, J. Algorithms 3, 182--195 (1982; Zbl 0494.68049) Full Text: DOI