✦ LIBER ✦

On the stable containment of two sets

✍ Scribed by Miguel A. Goberna; Virginia N. Vera de Serio

Book ID: 106414554
Publisher: Springer US
Year: 2008
Tongue: English
Weight: 191 KB
Volume: 41
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-007-9276-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the finiteness of stable sets

✍ John Hillas; Dries Vermeulen; Mathijs Jansen 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 193 KB

Maximal stable sets of two-player games

✍ Srihari Govindan; Robert Wilson 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 127 KB

Stable sets in two subclasses of banner-

Stable sets in two subclasses of banner-free graphs

✍ Michael U. Gerber; Alain Hertz; Vadim V. Lozin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 219 KB

The maximum stable set problem is NP-hard, even when restricted to banner-free graphs. In this paper, we use the augmenting graph approach to attack the problem in two subclasses of banner-free graphs. We ÿrst provide both classes with the complete characterization of minimal augmenting graphs. Base