Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time

被引：0
|
作者：
Agrawal, Akanksha [1 ]
Lima, Paloma T. [2 ]
Lokshtanov, Daniel [3 ]
Saurabh, Saket [4 ,5 ]
Sharma, Roohani [6 ]
机构：
[1] Indian Institute of Technology Madras, Chennai, India
[2] IT University of Copenhagen, Copenhagen, Denmark
[3] University of Califormia, Santa Barbara, United States
[4] Institute of Mathematical Sciences, Chennai, India
[5] University of Bergen, Norway
[6] Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbrücken, Germany
来源：
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2024年 / 2024-January卷
关键词：
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：5276 / 5290
相关论文
共 50 条
  • [21] Recognition and Optimization Algorithms for P5-Free Graphs
    Talmaciu, Mihai
    Dumitriu, Luminita
    Susnea, Ioan
    Lepin, Victor
    Iantovics, Laszlo Barna
    SYMMETRY-BASEL, 2020, 12 (02):
  • [22] t-PERFECTION IN P5-FREE GRAPHS
    Bruhn, Henning
    Fuchs, Elke
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (03) : 1616 - 1633
  • [23] Stability number in subclasses of P5-free graphs
    Zverovich I.E.
    Zverovich O.I.
    Applied Mathematics-A Journal of Chinese Universities, 2004, 19 (2) : 125 - 132
  • [24] Hypergraph Unreliability in Quasi-Polynomial Time
    Cen, Ruoxu
    Li, Jason
    Panigrahi, Debmalya
    PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 1700 - 1711
  • [25] EFFECTIVE ONLINE COLORING OF P5-FREE GRAPHS
    GYARFAS, A
    LEHEL, J
    COMBINATORICA, 1991, 11 (02) : 181 - 184
  • [26] On maximum independent sets in P5-free graphs
    Randerath, Bert
    Schiermeyer, Ingo
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (09) : 1041 - 1044
  • [27] Cops and robber on subclasses of P5-free graphs
    Gupta, Uttam K.
    Mishra, Suchismita
    Pradhan, Dinabandhu
    DISCRETE MATHEMATICS, 2023, 346 (06)
  • [28] ON 3-COLORABLE P5-FREE GRAPHS
    Maffray, Frederic
    Morel, Gregory
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (04) : 1682 - 1708
  • [29] Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs
    Pilipczuk, Michal
    van Leeuwen, Erik Jan
    Wiese, Andreas
    ALGORITHMICA, 2020, 82 (06) : 1703 - 1739
  • [30] Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
    Gartland, Peter
    Lokshtanov, Daniel
    Masarik, Tomas
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Rzazewski, Pawel
    PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 683 - 691
12345