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] Cycles through a prescribed vertex set in N-connected graphs
    Kawarabayashi, K
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 90 (02) : 315 - 323
  • [42] A generalization of AT-free graphs and a generic algorithm for solving treewidth, minimum fill-in and vertex ranking
    Broersma, H
    Kloks, T
    Kratsch, D
    Müller, H
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1998, 1517 : 88 - 99
  • [43] Induced Disjoint Paths in AT-free graphs
    Golovach, Petr A.
    Paulusma, Daniel
    van Leeuwen, Erik Jan
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2022, 124 : 170 - 191
  • [44] Vertex Pancyclicity of Quadrangularly Connected Claw-free Graphs
    Chen, Xiaodong
    Li, MingChu
    Ma, Xin
    GRAPHS AND COMBINATORICS, 2015, 31 (06) : 2125 - 2136
  • [45] Vertex Pancyclicity of Quadrangularly Connected Claw-free Graphs
    Xiaodong Chen
    MingChu Li
    Xin Ma
    Graphs and Combinatorics, 2015, 31 : 2125 - 2136
  • [46] On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
    Chandran, L. Sunil
    Francis, Mathew C.
    Sivadasan, Naveen
    GRAPH THEORY, COMPUTATIONAL INTELLIGENCE AND THOUGHT: ESSAYS DEDICATED TO MARTIN CHARLES GOLUMBIC ON THE OCCASION OF HIS 60TH BIRTHDAY, 2009, 5420 : 148 - +
  • [47] Detecting Induced Minors in AT-Free Graphs
    Golovach, Petr A.
    Kratsch, Dieter
    Paulusma, Daniel
    ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 495 - 505
  • [48] A Simple Local Search Gives a PTAS for the Feedback Vertex Set Problem in Minor-Free Graphs
    Le, Hung
    Zheng, Baigong
    COMPUTING AND COMBINATORICS, COCOON 2019, 2019, 11653 : 375 - 386
  • [49] Separator orders in interval, cocomparability, and AT-free graphs
    Backer, Jonathan
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (08) : 717 - 726
  • [50] Characterizing the Extremal k-Girth Graphs on Feedback Vertex Set
    Tang, Zhong-Zheng
    Diao, Zhuo
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2023,
12345