Extending the MAX Algorithm for Maximum Independent Set

Extending the MAX Algorithm for Maximum Independent Set

The maximum independent set problem is an NP-hard problem. In this paper, we consider Algorithm MAX, which is a polynomial time algorithm for finding a maximal independent set in a graph G. We present a set of forbidden induced subgraphs such that Algorithm MAX always results in finding a maximum in...

Full description

Bibliographic Details
Main Authors: Lê Ngoc C., Brause Christoph, Schiermeyer Ingo
Format: Article
Language:English
Published: Sciendo 2015-05-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
maximum independent set
stable set
stability number
independence number
reduction
graph transformation
max algorithm
min algorithm
vertex order algorithm
Online Access:https://doi.org/10.7151/dmgt.1811

Internet

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

Similar Items