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 条
  • [1] Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
    Xiao, Mingyu
    Kou, Shaowei
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2017), 2017, 10185 : 653 - 667
  • [2] Algorithm for Online 3-Path Vertex Cover
    Yubai Zhang
    Zhao Zhang
    Yishuo Shi
    Xianyue Li
    [J]. Theory of Computing Systems, 2020, 64 : 327 - 338
  • [3] Algorithm for Online 3-Path Vertex Cover
    Zhang, Yubai
    Zhang, Zhao
    Shi, Yishuo
    Li, Xianyue
    [J]. THEORY OF COMPUTING SYSTEMS, 2020, 64 (02) : 327 - 338
  • [4] A faster FPT algorithm for 3-path vertex cover
    Katrenic, Jan
    [J]. INFORMATION PROCESSING LETTERS, 2016, 116 (04) : 273 - 278
  • [5] Approximation algorithm for minimum connected 3-path vertex cover
    Liu, Pengcheng
    Zhang, Zhao
    Li, Xianyue
    Wu, Weili
    [J]. DISCRETE APPLIED MATHEMATICS, 2020, 287 : 77 - 84
  • [6] Kernelization of the 3-path vertex cover problem
    Brause, Christoph
    Schiermeyer, Ingo
    [J]. DISCRETE MATHEMATICS, 2016, 339 (07) : 1935 - 1939
  • [7] A 5k-vertex kernel for 3-path vertex cover
    Xiao, Mingyu
    Kou, Shaowei
    [J]. THEORETICAL COMPUTER SCIENCE, 2023, 959
  • [8] 3-PATH VERTEX COVER AND DISSOCIATION NUMBER OF HEXAGONAL GRAPHS
    Erves, Rija
    Tepeh, Aleksandra
    [J]. APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS, 2022, 16 (01) : 132 - 145
  • [9] Approximation algorithms for minimum weight connected 3-path vertex cover
    Ran, Yingli
    Zhang, Zhao
    Huang, Xiaohui
    Li, Xiaosong
    Du, Ding-Zhu
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2019, 347 : 723 - 733
  • [10] Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs
    Jena, Sangram K.
    Subramani, K.
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2022, 2022, 13571 : 103 - 115
12345