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

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 231; pp. 113 - 118
Main Author:	Brause, Christoph
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 20.11.2017
Subjects:	[formula omitted]-free Independent set Subexponential-time algorithm Independent set Pt-free Subexponential-time algorithm
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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 unknown. In this paper we present a subexponential algorithm for the Maximum (Weighted) Independent Set Problem in Pt-free graphs.
ISSN:	0166-218X 1872-6771
DOI:	10.1016/j.dam.2016.06.016