✦ LIBER ✦

Node-Deletion NP-Complete Problems

✍ Scribed by Krishnamoorthy, M. S.; Deo, Narsingh

Book ID: 118174048
Publisher: Society for Industrial and Applied Mathematics
Year: 1979
Tongue: English
Weight: 854 KB
Volume: 8
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0208049

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The node-deletion problem for hereditary

The node-deletion problem for hereditary properties is NP-complete

✍ John M. Lewis; Mihalis Yannakakis 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 801 KB

NP-complete scheduling problems

✍ J.D. Ullman 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 423 KB

We show that the problem of finding an optimal schedule for a set of jobs is NPcomplete even in the following two restricted cases. (1) All jobs require one time unit. (2) All jobs require one or two time units, and there are only two processor resolving (in the negative a conjecture of R. L. Grah

Complete problems for monotone NP

✍ Iain A. Stewart 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 768 KB

Certain NP-complete matching problems

✍ G. Loizou 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 311 KB

New NP-complete partition problems

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

Sequence, structure, and NP-complete pro

Sequence, structure, and NP-complete problems

✍ James Carifio 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB