We consider sequential heuristics methods for the Maximum Independent Set (MIS) problem. Three classical algorithms, VO , MIN , or MAX  , 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 [4,14] is verified and performance of the algorithms on some special graphs is considered.