The undirected feedback vertex set problem has a poly(k) kernel

被引:0
|
作者
Burrage, Kevin [1 ]
Estivill-Castro, Vladimir
Fellows, Michael
Langston, Michael
Mac, Shev
Rosamond, Frances
机构
[1] Univ Queensland, Dept Math, Brisbane, Qld 4072, Australia
[2] Griffith Univ, Brisbane, Qld 4111, Australia
[3] Univ Newcastle, Sch EE & CS, Newcastle, NSW 2308, Australia
[4] Univ Tennessee, Dept Comp Sci, Knoxville, TN 37996 USA
[5] Oak Ridge Natl Lab, Div Math & Comp Sci, Oak Ridge, TN 37831 USA
[6] Retreat Arts & Sci, Newcastle, NSW, Australia
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Resolving a noted open problem, we show that the UNDIRECTED FEEDBACK VERTEX SET problem, parameterized by the size of the solution set of vertices, is in the parameterized complexity class Poly(k), that is, polynomial-time pre-processing is sufficient to reduce an initial problem instance (G, k) to a decision-equivalent simplified instance (G', k') where k' <= k, and the number of vertices of G' is bounded by a polynomial function of k. Our main result shows an O(k(11)) kernelization bound.
引用
收藏
页码:192 / 202
页数:11
相关论文
共 50 条
  • [41] On the feedback vertex set problem for a planar graphÜber das Feedback-Vertex-Set-Problem für planare Graphen
    W. Hackbusch
    [J]. Computing, 1997, 58 (2) : 129 - 155
  • [42] Applying local search to the feedback vertex set problem
    Philippe Galinier
    Eunice Lemamou
    Mohamed Wassim Bouzidi
    [J]. Journal of Heuristics, 2013, 19 : 797 - 818
  • [43] Dynamic thresholding search for the feedback vertex set problem
    Sun, Wen
    Hao, Jin-Kao
    Wu, Zihao
    Li, Wenlong
    Wu, Qinghua
    [J]. PEERJ COMPUTER SCIENCE, 2023, 9
  • [44] Parameterized complexity of fair feedback vertex set problem
    Kanesh, Lawqueen
    Maity, Soumen
    Muluk, Komal
    Saurabh, Saket
    [J]. THEORETICAL COMPUTER SCIENCE, 2021, 867 : 1 - 12
  • [45] Deterministic Algorithms for the Independent Feedback Vertex Set Problem
    Tamura, Yuma
    Ito, Takehiro
    Zhou, Xiao
    [J]. COMBINATORIAL ALGORITHMS, IWOCA 2014, 2015, 8986 : 351 - 363
  • [46] Applying local search to the feedback vertex set problem
    Galinier, Philippe
    Lemamou, Eunice
    Bouzidi, Mohamed Wassim
    [J]. JOURNAL OF HEURISTICS, 2013, 19 (05) : 797 - 818
  • [47] A BAD EXAMPLE FOR THE MINIMUM FEEDBACK VERTEX SET PROBLEM
    DONALD, J
    ELWIN, J
    HAGER, R
    SALAMON, P
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1985, 32 (05): : 491 - 493
  • [48] A Memetic Algorithm for the Weighted Feedback Vertex Set Problem
    Carrabs, Francesco
    Cerrone, Carmine
    Cerulli, Raffaele
    [J]. NETWORKS, 2014, 64 (04) : 339 - 356
  • [49] Spin glass approach to the feedback vertex set problem
    Zhou, Hai-Jun
    [J]. EUROPEAN PHYSICAL JOURNAL B, 2013, 86 (11):
  • [50] An Efficient Local Search for the Feedback Vertex Set Problem
    Zhang, Zhiqiang
    Ye, Ansheng
    Zhou, Xiaoqing
    Shao, Zehui
    [J]. ALGORITHMS, 2013, 6 (04) : 726 - 746