𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recognizing graphs with fixed interval number is NP-complete

✍ Scribed by Douglas B. West; David B. Shmoys

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
722 KB
Volume
8
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recognizing triangle-free graphs with in
Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete
✍ Jacobson, Michael S.; K�zdy, Andr� E.; Lehel, Jen? 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 250 KB 👁 2 views

An induced path-cycle double cover (IPCDC) of a simple graph G is a family F Å {F 1 , . . . , F k } of induced paths and cycles of G such that if F i ʝ F j x M, then F i ʝ F j is a vertex or an edge, for i x j, each edge of G appears in precisely two of the F i 's, and each vertex of G appears in pr

Protocol insecurity with a finite number
Protocol insecurity with a finite number of sessions and composed keys is NP-complete
✍ Michaël Rusinowitch; Mathieu Turuani 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 341 KB

We investigate the complexity of the protocol insecurity problem for a ÿnite number of sessions (ÿxed number of interleaved runs). We show that this problem is NP-complete with respect to a Dolev-Yao model of intruders. The result does not assume a limit on the size of messages and supports non-atom