Author:
Brandstädt Andreas,Lozin Vadim,Mosca Raffaele
Reference21 articles.
1. Polynomial-time algorithm for maximum independent set in bounded-degree graphs with no long induced claws;T Abrishami;Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA),2022
2. On the local restriction effect on the complexity of finding the graph independence number;V E Alekseev;Combinatorial-algebraic Methods in Applied Mathematics,1983
3. Maximum weight independent set for lclaw-free graphs in polynomial time;A Brandst�dt;Discrete Applied Mathematics,2018
4. Paths, trees, and flowers;J Edmonds;Canadian J. Math,1965