Minimum degree algorithms for stability number

Authors:
Igor É. Zverovich
Affiliations:
RUTCOR-Rutgers Center for Operations Research, The State University of New Jersey, Rutgers, 640 Bartholomew Rd, Piscataway, NJ
Venue:
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Year:
2003

Citing 2
Cited 0

Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set

Discrete Mathematics
A note on vertex orders for stability number

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mahadev and Reed (J. Graph Theory 30(2) (1999) 113) found a finite 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.