✦ LIBER ✦

NP-completeness of some edge-disjoint paths problems

✍ Scribed by Jens Vygen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

NP-completeness of edge-colouring some r

✍ Leizhen Cai; John A. Ellis 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 850 KB

The edge Hamiltonian path problem is NP-

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

NP-Completeness of graph decomposition p

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

NP-completeness of minimum spanner probl

✍ Leizhen Cai 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 544 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.

NP-completeness of some problems of part

✍ B. Péroche 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 794 KB