A 5k-vertex kernel for 3-path vertex cover

被引：0
|
作者：
Xiao, Mingyu [1 ]
Kou, Shaowei [1 ]
机构：
[1] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Chengdu, Peoples R China
来源：
THEORETICAL COMPUTER SCIENCE | 2023年 / 959卷
基金：
中国国家自然科学基金;
关键词：
Graph algorithms; Kernelization; Parameterized algorithms; 3-Path vertex cover; DISSOCIATION NUMBER; PATH COVER; ALGORITHM; COMPLEXITY; GRAPH; SET;
D O I：
10.1016/j.tcs.2023.113872
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A 3-path vertex cover in a graph is a vertex subset C such that every path of three vertices contains at least one vertex from C. The parameterized 3-path vertex cover problem asks whether a graph has a 3-path vertex cover of size at most k. We give a kernel of 5k vertices for this problem, improving the previously known bounds.(c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数：20
相关论文
共 50 条
  • [1] Kernelization of the 3-path vertex cover problem
    Brause, Christoph
    Schiermeyer, Ingo
    [J]. DISCRETE MATHEMATICS, 2016, 339 (07) : 1935 - 1939
  • [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] Parameterized algorithm for 3-path vertex cover
    Tsur, Dekel
    [J]. THEORETICAL COMPUTER SCIENCE, 2019, 783 : 1 - 8
  • [4] 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
  • [5] A faster FPT algorithm for 3-path vertex cover
    Katrenic, Jan
    [J]. INFORMATION PROCESSING LETTERS, 2016, 116 (04) : 273 - 278
  • [6] 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
  • [7] A 5k-vertex kernel for P2-packing
    Li, Wenjun
    Ye, Junjie
    Cao, Yixin
    [J]. THEORETICAL COMPUTER SCIENCE, 2022, 910 : 1 - 13
  • [8] 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
  • [9] 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
  • [10] 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
12345