Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws

Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski. Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 1448-1470, SIAM, 2022. [doi]

Abstract

Abstract is missing.