The NP-completeness column: An ongoing guide
From MaRDI portal
Publication:5905223
DOI10.1016/0196-6774(82)90011-6zbMath0494.68048MaRDI QIDQ5905223
Publication date: 1982
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(82)90011-6
NP-complete problems; NP-completeness; chromatic index; graph isomorphism; total unimodularity; graph genus; subgraph homeomorphism; composite number; imperfect graph; 3-processor scheduling; minimum-length triangulation; spanning tree parity
Related Items
Minimum dimension embedding of finite metric spaces, Bipartite permutation graphs, On the complexity of H-coloring, Polynomial graph-colorings, Fixed edge-length graph drawing is NP-hard, Hereditarily hard \(H\)-colouring problems, Computing crossing numbers in quadratic time, A tabu thresholding algorithm for arc crossing minimization in bipartite graphs