Independent Set inP5-Free Graphs in Polynomial Time [chapter]

Daniel Lokshantov, Martin Vatshelle, Yngve Villanger
2013 Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms  
The Independent Set problem is NP-hard in general, however polynomial time algorithms exist for the problem on various specific graph classes. Over the last couple of decades there has been a long sequence of papers exploring the boundary between the NPhard and polynomial time solvable cases. In particular the complexity of Independent Set on P 5 -free graphs has received significant attention, and there has been a long list of results showing that the problem becomes polynomial time solvable
more » ... sub-classes of P 5 -free graphs. In this paper we give the first polynomial time algorithm for Independent Set on P 5 -free graphs. Our algorithm also works for the Weighted Independent Set problem.
doi:10.1137/1.9781611973402.43 dblp:conf/soda/LokshantovVV14 fatcat:jtvkt62z6jeurbs7nlylyh376q