✦ LIBER ✦

The Planar Hamiltonian Circuit Problem is NP-Complete

✍ Scribed by Garey, M. R.; Johnson, D. S.; Tarjan, R. Endre

Book ID: 118169405
Publisher: Society for Industrial and Applied Mathematics
Year: 1976
Tongue: English
Weight: 768 KB
Volume: 5
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0205049

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Hamiltonian circuit problem for circ

The Hamiltonian circuit problem for circle graphs is NP-complete

✍ Peter Damaschke 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 134 KB

The edge Hamiltonian path problem is NP-

The edge Hamiltonian path problem is NP-complete

✍ Alan A. Bertossi 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 354 KB

Planar 3DM is NP-complete

✍ M.E Dyer; A.M Frieze 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 591 KB

The edge Hamiltonian path problem is NP-

The edge Hamiltonian path problem is NP-complete for bipartite graphs

✍ Ten-Hwang Lai; Shu-Shang Wei 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 508 KB

Finding Hamiltonian circuits in arrangem

Finding Hamiltonian circuits in arrangements of Jordan curves is NP-complete

✍ Chuzo Iwamoto; ; ; Godfried T. Toussaint 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 615 KB

The STO problem is NP-complete

✍ P. Krysta; L. Pacholski 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 233 KB

We prove that the problem STO of deciding whether or not a finite set E of term equations is subject to occur-check is in NP. E is subject to occur-check if the execution of the Martelli-Montanari unification algorithm gives for input E a set E ∪ {x = t}, where t = x and x appears in t. Apt et al. (