✦ LIBER ✦

Maximum independent sets in subclasses of -free graphs

✍ Scribed by Vadim Lozin; Raffaele Mosca

Book ID: 108154602
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 177 KB
Volume: 109
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2008.11.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On maximum independent sets in -free gra

On maximum independent sets in -free graphs

✍ Bert Randerath; Ingo Schiermeyer 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 233 KB

Graphs with unique maximum independent s

Graphs with unique maximum independent sets

✍ Glenn Hopkins; William Staton 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 402 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

Independent dominating sets in triangle-

Independent dominating sets in triangle-free graphs

✍ Wayne Goddard; Jeremy Lyle 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 439 KB

On Independent Vertex Sets in Subclasses

On Independent Vertex Sets in Subclasses of

✍ Andreas Brandstädt; Tilo Klembt; Vadim V. Lozin; Raffaele Mosca 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 344 KB

Parallel maximum independent set in conv

Parallel maximum independent set in convex bipartite graphs

✍ Artur Czumaj; Krzysztof Diks; Teresa M. Przytycka 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 606 KB