✦ LIBER ✦

The edge Hamiltonian path problem is NP-complete

✍ Scribed by Alan A. Bertossi

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The edge Hamiltonian path problem is NP-

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

The Planar Hamiltonian Circuit Problem i

✍ Garey, M. R.; Johnson, D. S.; Tarjan, R. Endre 📂 Article 📅 1976 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 768 KB

NP-completeness of some edge-disjoint pa

✍ Jens Vygen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 446 KB

The maximum edge biclique problem is NP-

✍ René Peeters 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 93 KB

We prove that the maximum edge biclique problem in bipartite graphs is NP-complete.

The Hamiltonian circuit problem for circ

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

Maximizing edge-ratio is NP-complete

✍ Steven D. Noble; Pierre Hansen; Nenad Mladenović 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 206 KB