On sequential heurestic methods for the maximum independent set problem
Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer · Discussiones Mathematicae Graph Theory · 2017
We consider sequential heuristics methods for the Maximum Independent Set (MIS) problem. Three classical algorithms, VO [11], MIN [12], or MAX [6], are revisited. We combine Algorithm MIN with the -redundant vertex technique Induced forbidden subgraph sets, under which the algorithms give maximum independent sets, are described. The Caro-Wei bound