✦ LIBER ✦

Maximizing edge-ratio is NP-complete

✍ Scribed by Steven D. Noble; Pierre Hansen; Nenad Mladenović

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The edge Hamiltonian path problem is NP-

✍ Alan A. Bertossi 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 354 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.

Maximizing output and recognizing autoca

✍ Jakob L Andersen, Christoph Flamm, Daniel Merkle, Peter F Stadler 📂 Article 📅 2012 🏛 Chemistry Central 🌐 English ⚖ 468 KB

The NP-Completeness of Edge-Coloring

✍ Holyer, Ian 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 274 KB

The edge Hamiltonian path problem is NP-

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

Cyclic ordering is NP-complete

✍ Zvi Galil; Nimrod Megiddo 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 478 KB