Independent Set in P5-Free Graphs in Polynomial Time

DOI10.1137/1.9781611973402.43zbMath1422.68126MaRDI QIDQ5384003

Yngve Villanger, Martin Vatshelle, Daniel Lokshantov

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973402.43

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)