Connected Feedback Vertex Set, in Planar Graphs

被引：17
|
作者：
Grigoriev, Alexander [1 ]
Sitters, Rene [2 ]
机构：
[1] Maastricht Univ, Dept Quantitat Econ, Maastricht, Netherlands
[2] Vrije Univ Amsterdam, Dept Econometr & Operat Res, Amsterdam, Netherlands
来源：
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE | 2010年 / 5911卷
关键词：
APPROXIMATION ALGORITHMS;
D O I：
10.1007/978-3-642-11409-0_13
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study the problem of finding a minimum tree spanning the faces of a given planar graph. We show that a constant factor approximation follows from the unconnected version if the minimum degree is 3. Moreover, we present; a polynomial time approximation scheme for both the connected and unconnected version.
引用
收藏
页码：143 / +
页数：3
相关论文
共 50 条
  • [41] Building a Maximal Independent Set for the Vertex-coloring Problem on Planar Graphs
    Lopez-Ramirez, Cristina
    Gutierrez Gomez, Jorge Eduardo
    De Ita Luna, Guillermo
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2020, 354 (354) : 75 - 89
  • [42] Minimum size of feedback vertex sets of planar graphs of girth at least five
    Kelly, Tom
    Liu, Chun-Hung
    EUROPEAN JOURNAL OF COMBINATORICS, 2017, 61 : 138 - 150
  • [43] ON THE NONSEPARATING INDEPENDENT SET PROBLEM AND FEEDBACK SET PROBLEM FOR GRAPHS WITH NO VERTEX DEGREE EXCEEDING 3
    UENO, S
    KAJITANI, Y
    GOTOH, S
    DISCRETE MATHEMATICS, 1988, 72 (1-3) : 355 - 360
  • [44] Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
    Athanassios Koutsonas
    Dimitrios M. Thilikos
    Algorithmica, 2011, 60 : 987 - 1003
  • [45] Exact and Parameterized Algorithms for Restricted Subset Feedback Vertex Set in Chordal Graphs
    Bai, Tian
    Xiao, Mingyu
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2022, 2022, 13571 : 249 - 261
  • [46] A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler
    Xiao, Mingyu
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, AAIM 2014, 2014, 8546 : 288 - 298
  • [47] Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
    Koutsonas, Athanassios
    Thilikos, Dimitrios M.
    ALGORITHMICA, 2011, 60 (04) : 987 - 1003
  • [48] Fixed parameter enumeration algorithm for feedback vertex set in weighted undirected graphs
    Wang J.-X.
    Jiang G.-H.
    Chen J.-E.
    Jisuanji Xuebao/Chinese Journal of Computers, 2010, 33 (07): : 1140 - 1152
  • [49] Long-loop feedback vertex set and dismantling on bipartite factor graphs
    Li, Tianyi
    Zhang, Pan
    Zhou, Hai-Jun
    PHYSICAL REVIEW E, 2021, 103 (06)
  • [50] Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
    Charis Papadopoulos
    Spyridon Tzimas
    Algorithmica, 2024, 86 : 874 - 906
12345