✦ LIBER ✦

NP-completeness of some generalizations of the maximum matching problem

✍ Scribed by Larry J. Stockmeyer; Vijay V. Vazirani

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the NP-completeness of the perfect ma

✍ Mathieu Lacroix; A. Ridha Mahjoub; Sébastien Martin; Christophe Picouleau 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 231 KB

NP-completeness of some type of p-center

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

NP-Completeness of the linear complement

✍ S. J. Chung 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 283 KB

NP-completeness of the hamming salesman

✍ Jarmo Ernvall; Jyrki Katajainen; Martti Penttonen 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 211 KB

The NP-Completeness of Some Edge-Partiti

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

The NP-Completeness of the bandwidth min

✍ Ch. H. Papadimitriou 📂 Article 📅 1976 🏛 Springer Vienna 🌐 English ⚖ 375 KB