Authors
Michael R Garey, David S Johnson, Larry Stockmeyer
Publication date
1974/4/30
Book
Proceedings of the sixth annual ACM symposium on Theory of computing
Pages
47-63
Description
It is widely believed that showing a problem to be NP-complete is tantamount to proving its computational intractability. In this paper we show that a number of NP-complete problems remain NP-complete even when their domains are substantially restricted. First we show the completeness of SIMPLE MAX CUT (MAX CUT with edge weights restricted to value 1), and, as a corollary, the completeness of the OPTIMAL LINEAR ARRANGEMENT problem. We then show that even if the domains of the NODE COVER and DIRECTED HAMILTONIAN PATH problems are restricted to planar graphs, the two problems remain NP-complete, and that these and other graph problems remain NP-complete even when their domains are restricted to graphs with low node degrees. For GRAPH 3-COLORABILITY, NODE COVER, and UNDIRECTED HAMILTONIAN CIRCUIT, we determine essentially the lowest possible upper bounds …
Total citations
1985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024152425133037384453525252504464626764677811288102119136104124127138152168141177169150180148171168116
Scholar articles
MR Garey, DS Johnson, L Stockmeyer - Proceedings of the sixth annual ACM symposium on …, 1974
DS Johnson, MR Garey, L Stockmeyer - Proc. Symp. Theory Comput, 1974
MR Garey, DS Johnson, L Stockmeyer - Proc. 6th ACM Symposium on Theorv of Comnuting …
MR Garey, DS Johnson, RL Stockmeyer - 6th Annual ACM Symp. on Theory of Computing, 1974