✦ LIBER ✦

Sequence, structure, and NP-complete problems

✍ Scribed by James Carifio

Book ID: 112215630
Publisher: John Wiley and Sons
Year: 1979
Tongue: English
Weight: 301 KB
Volume: 16
Category: Article
ISSN: 0022-4308
DOI: 10.1002/tea.3660160316

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some NP-complete problems for hypergraph

Some NP-complete problems for hypergraph degree sequences

✍ Charles J. Colbourn; W.L. Kocay; D.R. Stinson 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 641 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

Node-Deletion NP-Complete Problems

✍ Krishnamoorthy, M. S.; Deo, Narsingh 📂 Article 📅 1979 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 854 KB

Local search and the local structure of

Local search and the local structure of NP-complete problems

✍ Lov K. Grover 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 479 KB

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