✦ LIBER ✦

NP-completeness of some problems of partitioning and covering in graphs

✍ Scribed by B. Péroche

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

NP-Completeness of graph decomposition p

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

NP-completeness of some edge-disjoint pa

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

NP-completeness of a family of graph-col

✍ Robert W. Irving 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 417 KB

NP-completeness of some type of p-center

✍ Tohru Kikuno; Noriyoshi Yoshida; Yoshiaki Kakuda 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Graph theoretic relaxations of set cover

✍ Elia El-Darzi; Gautam Mitra 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 786 KB