✦ LIBER ✦

NP-completeness of some type of p-center problem

✍ Scribed by Tohru Kikuno; Noriyoshi Yoshida; Yoshiaki Kakuda

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

Strong NP-completeness of a matrix simil

✍ V. Brimkov; B. Codenotti; M. Leoncini; G. Resta 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 469 KB

Average polynomial time complexity of so

✍ Phan Dinh Dieu; Le Cong Thanh; Le Tuan Hoa 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 900 KB

NP-completeness of edge-colouring some r

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

NP-completeness of some problems of part

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

NP-Completeness of graph decomposition p

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