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 条
  • [41] On-line graph coloring of P5-free graphs
    Cieslik, Iwona
    ACTA INFORMATICA, 2008, 45 (02) : 79 - 91
  • [42] Constructions of k-critical P5-free graphs
    Hoang, Chinh T.
    Moore, Brian
    Recoskie, Daniel
    Sawada, Joe
    Vatshelle, Martin
    DISCRETE APPLIED MATHEMATICS, 2015, 182 : 91 - 98
  • [43] WEIGHTED EFFICIENT DOMINATION FOR P5-FREE AND P6-FREE GRAPHS
    Brandstaedt, Andreas
    Mosca, Raffaele
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2016, 30 (04) : 2288 - 2303
  • [44] On the time-reparametrization of quasi-polynomial systems
    Szederkényi, G
    Hangos, KM
    Magyar, A
    PHYSICS LETTERS A, 2005, 334 (04) : 288 - 294
  • [45] On the stable set problem in special P5-free graphs
    Gerber, MU
    Lozin, VV
    DISCRETE APPLIED MATHEMATICS, 2003, 125 (2-3) : 215 - 224
  • [46] A note on efficient domination in a superclass of P5-free graphs
    Brandstaedt, Andreas
    Le, Van Bang
    INFORMATION PROCESSING LETTERS, 2014, 114 (07) : 357 - 359
  • [47] Independent Feedback Vertex Set for P5-Free Graphs
    Bonamy, Marthe
    Dabrowski, Konrad K.
    Feghali, Carl
    Johnson, Matthew
    Paulusma, Daniel
    ALGORITHMICA, 2019, 81 (04) : 1342 - 1369
  • [48] On minimal cutsets in P5-free minimal imperfect graphs
    Barré, V
    Fouquet, JL
    DISCRETE MATHEMATICS, 2001, 236 (1-3) : 25 - 36
  • [49] Some results on k-critical P5-free graphs
    Cai, Qingqiong
    Goedgebeur, Jan
    Huang, Shenwei
    DISCRETE APPLIED MATHEMATICS, 2023, 334 : 91 - 100
  • [50] DECIDING PARITY GAMES IN QUASI-POLYNOMIAL TIME
    Calude, Cristian S.
    Jain, Sanjay
    Khoussainov, Bakhadyr
    Li, Wei
    Stephan, Frank
    SIAM JOURNAL ON COMPUTING, 2022, 51 (02)
12345