A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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 solvabledoi:10.1137/1.9781611973402.43 dblp:conf/soda/LokshantovVV14 fatcat:jtvkt62z6jeurbs7nlylyh376q