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 条
  • [31] 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
  • [32] 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
  • [33] A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs
    Jansen, Bart M. P.
    Pilipczuk, Marcin
    van Leeuwen, Erik Jan
    36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019), 2019,
  • [34] A DETERMINISTIC POLYNOMIAL KERNEL FOR ODD CYCLE TRANSVERSAL AND VERTEX MULTIWAY CUT IN PLANAR GRAPHS
    Jansen, Bart M. P.
    Pilipczuk, Marcin L.
    Van Leeuwen, Erik Jan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021, 35 (04) : 2387 - 2429
  • [35] Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs
    Michał Pilipczuk
    Erik Jan van Leeuwen
    Andreas Wiese
    Algorithmica, 2020, 82 : 1703 - 1739
  • [36] QUASI-POLYNOMIAL TIME APPROXIMATION SCHEMES FOR THE MAXIMUM WEIGHT INDEPENDENT SET PROBLEM IN H-FREE GRAPHS
    Chudnovsky, Maria
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Thomasse, Stephan
    SIAM JOURNAL ON COMPUTING, 2024, 53 (01) : 47 - 86
  • [37] Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs
    Chudnovsky, Maria
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Thomasse, Stephan
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 2260 - 2278
  • [38] Weighted Efficient Domination for P6-Free and for P5-Free Graphs
    Brandstaedt, Andreas
    Mosca, Raffaele
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2016, 2016, 9941 : 38 - 49
  • [39] Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs 1
    Univ. degli Studi di l'Aquila, Dipto. di Matemat. Pura e Applicata, via Vetoio, 67010 Coppito , Italy
    Inf. Process. Lett., 3 (137-143):
  • [40] Hull number: P5-free graphs and reduction rules
    Araujo, J.
    Morel, G.
    Sampaio, L.
    Soares, R.
    Weber, V.
    DISCRETE APPLIED MATHEMATICS, 2016, 210 : 171 - 175
12345