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 条
  • [21] A kernel of order 2k-c for Vertex Cover
    Soleimanfallah, Arezou
    Yeo, Anders
    [J]. DISCRETE MATHEMATICS, 2011, 311 (10-11) : 892 - 895
  • [22] Complexity of the Maximum k-Path Vertex Cover Problem
    Miyano, Eiji
    Saitoh, Toshiki
    Uehara, Ryuhei
    Yagita, Tsuyoshi
    van der Zanden, Tom C.
    [J]. WALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2018, 2018, 10755 : 240 - 251
  • [23] Complexity of the Maximum k-Path Vertex Cover Problem
    Miyano, Eiji
    Saitoh, Toshiki
    Uehara, Ryuhei
    Yagita, Tsuyoshi
    van der Zanden, Tom C.
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2020, E103A (10) : 1193 - 1201
  • [24] On the k-path vertex cover of some graph products
    Jakovac, Marko
    Taranenko, Andrej
    [J]. DISCRETE MATHEMATICS, 2013, 313 (01) : 94 - 100
  • [25] The k-path vertex cover of rooted product graphs
    Jakovac, Marko
    [J]. DISCRETE APPLIED MATHEMATICS, 2015, 187 : 111 - 119
  • [26] On a relation between k-path partition and k-path vertex cover
    Brause, Christoph
    Krivos-Bellus, Rastislav
    [J]. DISCRETE APPLIED MATHEMATICS, 2017, 223 : 28 - 38
  • [27] A kernel of order 2k-c log k for vertex cover
    Lampis, Michael
    [J]. INFORMATION PROCESSING LETTERS, 2011, 111 (23-24) : 1089 - 1091
  • [28] Reoptimization of Path Vertex Cover Problem
    Kumar, Mehul
    Kumar, Amit
    Rangan, C. Pandu
    [J]. COMPUTING AND COMBINATORICS, COCOON 2019, 2019, 11653 : 363 - 374
  • [29] PTAS for minimum k-path vertex cover in ball graph
    Zhang, Zhao
    Li, Xiaoting
    Shi, Yishuo
    Nie, Hongmei
    Zhu, Yuqing
    [J]. INFORMATION PROCESSING LETTERS, 2017, 119 : 9 - 13
  • [30] Minimum k-Path Vertex Cover in Cartesian Product Graphs
    Huiling YIN
    Binbin HAO
    Xiaoyan SU
    Jingrong CHEN
    [J]. Journal of Mathematical Research with Applications, 2021, 41 (04) : 340 - 348
12345