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

Abstract

The well-known greedy algorithm MIN for 6nding a maximal independent set in a graph G is based on recursively removing the closed neighborhood of a vertex which has (in the currently existing graph) minimum degree. We give a forbidden induced subgraph condition under which algorithm MIN always results in 6nding a maximum independent set of G, and hence yields the exact value of the independence number of G in polynomial time. c © 2002 Elsevier Science B.V. All rights reserved.

DOI: 10.1016/S0012-365X(02)00571-X

Extracted Key Phrases

Cite this paper

@article{Harant2002ForbiddenSI, title={Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set}, author={Jochen Harant and Zdenek Ryj{\'a}cek and Ingo Schiermeyer}, journal={Discrete Mathematics}, year={2002}, volume={256}, pages={193-201} }