Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time-Reference-Cited by-同舟云学术

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time

Published:2024-06-10 Issue: Volume: Page:683-691
ISSN:
Container-title:Proceedings of the 56th Annual ACM Symposium on Theory of Computing
language:
Short-container-title:

Author:

Gartland Peter¹^ORCID,Lokshtanov Daniel¹^ORCID,Masařík Tomáš²^ORCID,Pilipczuk Marcin³^ORCID,Pilipczuk Michał²^ORCID,Rzążewski Paweł⁴^ORCID

Affiliation:

1. University of California, Santa Barbara, USA

2. University of Warsaw, Warsaw, Poland

3. University of Warsaw, Warsaw, Poland / IT University, Copenhagen, Denmark

4. Warsaw University of Technology, Warsaw, Poland / University of Warsaw, Warsaw, Poland

Funder

NSF (National Science Foundation)

European Research Council

Narodowe Centrum Nauki

Villum Fonden

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3618260.3649791

Reference48 articles.

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

2. Induced subgraphs of bounded treewidth and the container method

3. Vladimir E. Alekseev. 1982. The effect of local constraints on the complexity of determination of the graph independence number. Combinatorial-algebraic methods in applied mathematics 3–13.

4. Polynomial algorithm for finding the largest independent sets in graphs without forks

5. Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10