Connected Feedback Vertex Set on AT-Free Graphs

被引：0
|
作者：
Mukherjee, Joydeep [1 ]
Saha, Tamojit [1 ,2 ]
机构：
[1] Ramakrishna Mission Vivekananda Educ & Res Inst, Howrah, India
[2] TCG CREST, Inst Adv Intelligence, Kolkata, India
来源：
COMBINATORIAL ALGORITHMS, IWOCA 2023 | 2023年 / 13889卷
关键词：
Graph Algorithm; Approximation Algorithm; AT-free graph; Feedback Vertex Set; Combinatorial Optimization; ALGORITHM;
D O I：
10.1007/978-3-031-34347-6_27
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A connected feedback vertex set of a graph is a connected subgraph of the graph whose removal makes the graph cycle free. In this paper, we give an approximation algorithm that computes a connected feedback vertex set of size (1.9091OPT + 6) on 2-connected AT-free graphs with running time O(n(8)m(2)). Also, we give another approximation algorithm that computes a connected feedback vertex set of size (2.9091OPT + 6) on the same graph class with more efficient running time O(min{m(log(n)), n(2)}).
引用
收藏
页码：319 / 330
页数：12
相关论文
共 50 条
  • [31] Subset Feedback Vertex Set in Chordal and Split Graphs
    Geevarghese Philip
    Varun Rajan
    Saket Saurabh
    Prafullkumar Tale
    Algorithmica, 2019, 81 : 3586 - 3629
  • [32] Approximating the treewidth of AT-free graphs
    Bouchitté, V
    Todinca, I
    DISCRETE APPLIED MATHEMATICS, 2003, 131 (01) : 11 - 37
  • [33] Subset feedback vertex set on graphs of bounded independent set size
    Papadopoulos, Charis
    Tzimas, Spyridon
    THEORETICAL COMPUTER SCIENCE, 2020, 814 : 177 - 188
  • [34] FEEDBACK VERTEX SET AND EVEN CYCLE TRANSVERSAL FOR H-FREE GRAPHS: FINDING LARGE BLOCK GRAPHS
    Paesani, Giacomo
    Paulusma, Daniel
    Rzazewski, Pawel
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (04) : 2453 - 2472
  • [35] Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs
    Tamura, Yuma
    Ito, Takehiro
    Zhou, Xiao
    WALCOM: ALGORITHMS AND COMPUTATION (WALCOM 2020), 2020, 12049 : 286 - 295
  • [36] Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs
    Borradaile, Glencora
    Le, Hung
    Zheng, Baigong
    ANALYSIS OF EXPERIMENTAL ALGORITHMS, SEA2 2019, 2019, 11544 : 98 - 113
  • [37] Feedback vertex set on graphs of low clique-width
    Binh-Minh Bui-Xuan
    Suchy, Ondrej
    Telle, Jan Arne
    Vatshelle, Martin
    EUROPEAN JOURNAL OF COMBINATORICS, 2013, 34 (03) : 666 - 679
  • [38] Approximability of the independent feedback vertex set problem for bipartite graphs
    Tamura, Yuma
    Ito, Takehiro
    Zhou, Xiao
    THEORETICAL COMPUTER SCIENCE, 2021, 849 : 227 - 236
  • [39] Detecting induced minors in AT-free graphs
    Golovach, Petr A.
    Kratsch, Dieter
    Paulusma, Daniel
    THEORETICAL COMPUTER SCIENCE, 2013, 482 : 20 - 32
  • [40] Linear orderings of subfamilies of AT-free graphs
    Corneil, DG
    Köhler, E
    Olariu, S
    Stewart, L
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 20 (01) : 105 - 118
12345