Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs
verfasst von : Vadim Lozin, Jérôme Monnot, Bernard Ries
Erschienen in: Combinatorial Algorithms
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
It is known that the maximum independent set problem is NP-complete for subcubic graphs, i.e. graphs of vertex degree at most 3. Moreover, the problem is NP-complete for
H
-free subcubic graphs whenever
H
contains a connected component which is not a tree with at most 3 leaves. We show that if every connected component of
H
is a tree with at most 3 leaves and at most 7 vertices, then the problem can be solved for
H
-free subcubic graphs in polynomial time.