Independent Set in P5-Free Graphs in Polynomial Time

@inproceedings{Lokshtanov2014IndependentSI,
  title={Independent Set in P5-Free Graphs in Polynomial Time},
  author={D. Lokshtanov and M. Vatshelle and Yngve Villanger},
  booktitle={SODA},
  year={2014}
}
  • D. Lokshtanov, M. Vatshelle, Yngve Villanger
  • Published in SODA 2014
  • Computer Science, Mathematics
  • 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 NP-hard and polynomial time solvable cases. In particular the complexity of Independent Set on P5-free graphs has received significant attention, and there has been a long list of results showing that the problem becomes polynomial time solvable on… CONTINUE READING
    108 Citations
    Weighted independent sets in classes of P6-free graphs
    • 12
    A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs
    • 14
    On the maximum independent set problem in subclasses of subcubic graphs
    • 15
    • PDF
    Parameterized Complexity of Independent Set in H-Free Graphs
    Independence and Efficient Domination on P6-free Graphs
    • 25
    • PDF
    icient Domination on P 6-free Graphs
    • PDF
    H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms
    • 8
    • PDF
    Weighted efficient domination in two subclasses of P6-free graphs
    • 10

    References

    SHOWING 1-10 OF 64 REFERENCES
    On maximum independent sets in P5-free graphs
    • 19
    On the stable set problem in special P5-free graphs
    • 44
    Independent sets in extensions of 2K2-free graphs
    • 55
    An augmenting graph approach to the stable set problem in P5-free graphs
    • 23
    A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
    • 101
    • PDF
    A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
    • 9
    Some Results on Stable Sets for k-Colorable P6-Free Graphs and Generalizations
    • R. Mosca
    • Mathematics, Computer Science
    • Discret. Math. Theor. Comput. Sci.
    • 2012
    • 7
    Deciding k-Colorability of P5-Free Graphs in Polynomial Time
    • 132
    • PDF
    On 3-Colorable P5-Free Graphs
    • 30
    Some observations on maximum weight stable sets in certain P
    • R. Mosca
    • Mathematics, Computer Science
    • Eur. J. Oper. Res.
    • 2008
    • 11