A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs

The Maximum Independent Set Problem is known to be NP-hard in general. In the last decades lots of effort were spent to find polynomial-time algorithms for Pt-free graphs. A recent result presents such an algorithm for P5-free graphs. On the other hand, the complexity status for larger t is still un...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics Jg. 231; S. 113 - 118
1. Verfasser:	Brause, Christoph
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 20.11.2017
Schlagworte:	[formula omitted]-free Independent set Subexponential-time algorithm Independent set Pt-free Subexponential-time algorithm
ISSN:	0166-218X, 1872-6771
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!