Minimum degree algorithms for stability number

✍ Scribed by Igor É. Zverovich

• Book ID: 104294302
• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 222 KB
• Volume: 132
• Category: Article
• ISSN: 0166-218X
• DOI: 10.1016/s0166-218x(03)00402-5

✦ Synopsis

Mahadev and Reed (J. Graph Theory 30(2) (1999) 113) found a ÿnite forbidden induced subgraph characterization for the maximal hereditary class of graphs where a minimum degree greedy algorithm produces a maximum stable set. We extend this class.