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 条
  • [11] On computing the minimum 3-path vertex cover and dissociation number of graphs
    Kardos, Frantisek
    Katrenic, Jan
    Schiermeyer, Ingo
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (50) : 7009 - 7017
  • [12] Parameterized algorithm for eternal vertex cover
    Fomin, Fedor V.
    Gaspers, Serge
    Golovach, Petr A.
    Kratsch, Dieter
    Saurabh, Saket
    [J]. INFORMATION PROCESSING LETTERS, 2010, 110 (16) : 702 - 706
  • [13] Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
    Xiao, Mingyu
    Kou, Shaowei
    [J]. THEORETICAL COMPUTER SCIENCE, 2017, 657 : 86 - 97
  • [14] Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs
    Xiao, Mingyu
    Kou, Shaowei
    [J]. FRONTIERS IN ALGORITHMICS (FAW 2015), 2015, 9130 : 282 - 293
  • [15] Maximum Minimal Vertex Cover Parameterized by Vertex Cover
    Zehavi, Meirav
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT II, 2015, 9235 : 589 - 600
  • [16] MAXIMUM MINIMAL VERTEX COVER PARAMETERIZED BY VERTEX COVER
    Zehavi, Meirav
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (04) : 2440 - 2456
  • [17] On Cutwidth Parameterized by Vertex Cover
    Marek Cygan
    Daniel Lokshtanov
    Marcin Pilipczuk
    Michał Pilipczuk
    Saket Saurabh
    [J]. Algorithmica, 2014, 68 : 940 - 953
  • [18] Parameterized Power Vertex Cover
    Angel, Eric
    Bampis, Evripidis
    Escoffier, Bruno
    Lampis, Michael
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2016, 2016, 9941 : 97 - 108
  • [19] Parameterized Power Vertex Cover
    Angel, Eric
    Bampis, Evripidis
    Escoffier, Bruno
    Lampis, Michael
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2018, 20 (02):
  • [20] On Cutwidth Parameterized by Vertex Cover
    Cygan, Marek
    Lokshtanov, Daniel
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Saurabh, Saket
    [J]. ALGORITHMICA, 2014, 68 (04) : 940 - 953
12345