𝔖 Bobbio Scriptorium
✦   LIBER   ✦

“NP = P?” and restricted partitions

✍ Scribed by Guo-Qiang Zhang

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
485 KB
Volume
32
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A problem of restricted partitions
A problem of restricted partitions
✍ V. R. R. Uppuluri; J. A. Carpenter 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB
NP-completeness and degree restricted sp
NP-completeness and degree restricted spanning trees
✍ Robert James Douglas 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 449 KB

In this paper several results are proved: (1) Deciding whether a given planar graph G with maximum degree 3 has a spanning tree T, where deg(x, T) = 1 or 3 for each node x, is NP-Complete. (2) For each proper subset S of the positive integers Z+ with 1 E S and (S( 2 2, deciding whether a planar gra