✦ LIBER ✦

The NP-Completeness of Some Edge-Partition Problems

✍ Scribed by Holyer, Ian

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

NP-completeness of some edge-disjoint pa

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

New NP-complete partition problems

✍ Saeednia, S. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 229 KB

NP-completeness of edge-colouring some r

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

The NP-Completeness of Edge-Coloring

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

NP-completeness of some problems of part

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

NP-completeness of some problems concern

✍ K. Prasad; J. S. Kelly 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 349 KB