Parameterized algorithm for 3-path vertex cover

被引：19
|
作者：
Tsur, Dekel [1 ]
机构：
[1] Ben Gurion Univ Negev, Dept Comp Sci, Beer Sheva, Israel
来源：
THEORETICAL COMPUTER SCIENCE | 2019年 / 783卷
关键词：
3-path vertex cover; Graph algorithms; Parameterized complexity;
D O I：
10.1016/j.tcs.2019.03.013
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In the 3-path vertex cover problem, the input is an undirected graph G and an integer kappa. The goal is to decide whether there is a set of vertices S of size at most kappa such that every path with 3 vertices in G contains at least one vertex of S. In this paper we give a parameterized algorithm for 3-path vertex cover whose time complexity is O*(1.713(kappa)). Our algorithm is faster than previous algorithms for this problem. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码：1 / 8
页数：8
相关论文
共 50 条
  • [41] On book thickness parameterized by the vertex cover number
    Liu, Yunlong
    Chen, Jie
    Huang, Jingui
    [J]. SCIENCE CHINA-INFORMATION SCIENCES, 2022, 65 (04)
  • [42] Parameterized complexity of generalized vertex cover problems
    Guo, J
    Niedermeier, R
    Wernicke, S
    [J]. ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2005, 3608 : 36 - 48
  • [43] Stackelberg Vertex Cover on a Path
    Eickhoff, Katharina
    Kauther, Lennart
    Peis, Britta
    [J]. ALGORITHMIC GAME THEORY, SAGT 2023, 2023, 14238 : 22 - 39
  • [44] A Note on Outerplanar 3-Path Graphs
    Zayed, Mohra
    Zhang, Ping
    [J]. ARS COMBINATORIA, 2020, 153 : 187 - 194
  • [45] Target Set Selection Parameterized by Vertex Cover and More
    Banerjee, Suman
    Mathew, Rogers
    Panolan, Fahad
    [J]. THEORY OF COMPUTING SYSTEMS, 2022, 66 (05) : 996 - 1018
  • [46] Maximum common induced subgraph parameterized by vertex cover
    Abu-Khzam, Faisal N.
    [J]. INFORMATION PROCESSING LETTERS, 2014, 114 (03) : 99 - 103
  • [47] On the parameterized vertex cover problem for graphs with perfect matching
    WANG JianXin
    LI WenJun
    LI ShaoHua
    CHEN JianEr
    [J]. Science China(Information Sciences), 2014, 57 (07) : 105 - 116
  • [48] Target Set Selection Parameterized by Vertex Cover and More
    Suman Banerjee
    Rogers Mathew
    Fahad Panolan
    [J]. Theory of Computing Systems, 2022, 66 : 996 - 1018
  • [49] On the parameterized vertex cover problem for graphs with perfect matching
    JianXin Wang
    WenJun Li
    ShaoHua Li
    JianEr Chen
    [J]. Science China Information Sciences, 2014, 57 : 1 - 12
  • [50] Parameterized Reductions and Algorithms for Another Vertex Cover Generalization
    Damaschke, Peter
    Molokov, Leonid
    [J]. ALGORITHMS AND DATA STRUCTURES, 2011, 6844 : 279 - +
12345