The NP-completeness column: An ongoing guide

DOI10.1016/0196-6774(88)90033-8zbMath0651.68054OpenAlexW4231922962MaRDI QIDQ5903717

David S. Johnson

Publication date: 1988

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(88)90033-8

zbMATH Keywords

NP-completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

A term equality problem equivalent to graph isomorphism ⋮ Fractional Strong Matching Preclusion for DHcube ⋮ Hamiltonian properties of some compound networks ⋮ Polynomial-time instances of the minimum weight triangulation problem

This page was built for publication: The NP-completeness column: An ongoing guide