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 条
  • [41] Induced Disjoint Paths in AT-free graphs
    Golovach, Petr A.
    Paulusma, Daniel
    van Leeuwen, Erik Jan
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2022, 124 : 170 - 191
  • [42] Vertex Pancyclicity of Quadrangularly Connected Claw-free Graphs
    Chen, Xiaodong
    Li, MingChu
    Ma, Xin
    [J]. GRAPHS AND COMBINATORICS, 2015, 31 (06) : 2125 - 2136
  • [43] Vertex Pancyclicity of Quadrangularly Connected Claw-free Graphs
    Xiaodong Chen
    MingChu Li
    Xin Ma
    [J]. Graphs and Combinatorics, 2015, 31 : 2125 - 2136
  • [44] On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
    Chandran, L. Sunil
    Francis, Mathew C.
    Sivadasan, Naveen
    [J]. GRAPH THEORY, COMPUTATIONAL INTELLIGENCE AND THOUGHT: ESSAYS DEDICATED TO MARTIN CHARLES GOLUMBIC ON THE OCCASION OF HIS 60TH BIRTHDAY, 2009, 5420 : 148 - +
  • [45] Detecting Induced Minors in AT-Free Graphs
    Golovach, Petr A.
    Kratsch, Dieter
    Paulusma, Daniel
    [J]. ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 495 - 505
  • [46] A Simple Local Search Gives a PTAS for the Feedback Vertex Set Problem in Minor-Free Graphs
    Le, Hung
    Zheng, Baigong
    [J]. COMPUTING AND COMBINATORICS, COCOON 2019, 2019, 11653 : 375 - 386
  • [47] Separator orders in interval, cocomparability, and AT-free graphs
    Backer, Jonathan
    [J]. DISCRETE APPLIED MATHEMATICS, 2011, 159 (08) : 717 - 726
  • [48] Characterizing the Extremal k-Girth Graphs on Feedback Vertex Set
    Tang, Zhong-Zheng
    Diao, Zhuo
    [J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2023,
  • [49] AT-free graphs: linear bounds for the oriented diameter
    Fomin, FV
    Matamala, M
    Prisner, E
    Rapaport, I
    [J]. DISCRETE APPLIED MATHEMATICS, 2004, 141 (1-3) : 135 - 148
  • [50] Complexity of paired domination in AT-free and planar graphs
    Tripathi, Vikash
    Kloks, Ton
    Pandey, Arti
    Paul, Kaustav
    Wang, Hung -Lung
    [J]. THEORETICAL COMPUTER SCIENCE, 2022, 930 : 53 - 62
12345