Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs

DOI10.1137/1.9781611975482.77zbMath1431.68047arXiv1707.05491MaRDI QIDQ5236261

Marcin Pilipczuk, Michał Pilipczuk, Tereza Klimošová, Andrzej Grzesik

Publication date: 15 October 2019

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

Full work available at URL: https://arxiv.org/abs/1707.05491

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