✦ LIBER ✦

The graph genus problem is NP-complete

✍ Scribed by Carsten Thomassen

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 471 KB
Volume: 10
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(89)90006-0

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 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. (

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

NP-Completeness of graph decomposition p

NP-Completeness of graph decomposition problems

✍ Edith Cohen; Michael Tarsi 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 689 KB

The shortest common nonsubsequence probl

The shortest common nonsubsequence problem is NP-complete

✍ M. Middendorf 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 337 KB

Le probleme d'etoiles pour graphes est n

Le probleme d'etoiles pour graphes est np-complet

✍ François Lalonde 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 884 KB

Nous appelons problkme de "recoIlement de voisinages" (RV) ("'star prnblem" ou "problk~e d'ktoiles") le probEme qui consiste B savoir, &ant donnee une familje 3r de parties d'un ensemble S, s'il existe un graphe (non orient4 et sans bouclc) dont la famille de voisinages coincide avec 9". L'objectif