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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Discrete Applied Mathematics Ročník 231; s. 113 - 118
Hlavný autor:	Brause, Christoph
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 20.11.2017
Predmet:	[formula omitted]-free Independent set Subexponential-time algorithm Independent set Pt-free Subexponential-time algorithm
ISSN:	0166-218X, 1872-6771
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!