On Sequential Heuristic Methods for the Maximum Independent Set Problem

On Sequential Heuristic Methods for the Maximum Independent Set Problem

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[3]. Induced forbidden subgraph sets, under which the algorithms give maxi...

Full description

Bibliographic Details
Main Authors: Lê Ngoc C., Brause Christoph, Schiermeyer Ingo
Format: Article
Language:English
Published: Sciendo 2017-05-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
maximum independent set
heuristic
min
max
vo
vertex ordering
Online Access:https://doi.org/10.7151/dmgt.1965

Internet

https://doi.org/10.7151/dmgt.1965

Similar Items