Computational complexity of minimum P4 vertex cover problem for regular and K1,4-free graphs

被引：9
|
作者：
Devi, N. Safina [1 ]
Mane, Aniket C. [2 ]
Mishra, Sounaka [1 ]
机构：
[1] Indian Inst Technol, Dept Math, Madras 600036, Tamil Nadu, India
[2] Birla Inst Technol & Sci Pilani, Pilani 403726, Goa, India
来源：
DISCRETE APPLIED MATHEMATICS | 2015年 / 184卷
关键词：
P-4 vertex cover; Regular graph; K-1; K-4-free graph; Approximation algorithm; NODE-DELETION PROBLEMS; APPROXIMATION ALGORITHM; BIPARTITE GRAPHS; CUBIC GRAPHS;
D O I：
10.1016/j.dam.2014.10.033
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In VCP4 problem, it is asked to find a set S subset of V of minimum size such that G[V\S] contains no path on 4 vertices, in a given graph G = (V, E). We prove that it is APX-complete for 3-regular graphs as well as 3-regular bipartite graphs. We show that a greedy based algorithm approximates VCP4 within a factor of 2 for regular graphs. We also show that VCP4 is APX-complete for K-1,K-4-free graphs and a local ratio based algorithm generates a solution which is within a factor of 3. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码：114 / 121
页数：8
相关论文
共 36 条
  • [21] Spanning 3-ended trees in k-connected K1,4-free graphs
    Yuan Chen
    GuanTao Chen
    ZhiQuan Hu
    Science China Mathematics, 2014, 57 : 1579 - 1586
  • [22] Note on the longest paths in {K1,4, K1,4 + e}-free graphs
    Fang Duan
    Guo Ping Wang
    Acta Mathematica Sinica, English Series, 2012, 28 : 2501 - 2506
  • [23] Hamilton paths in {K1,4, K1,4+e}-free graphs
    Lin, Houyuan
    Wang, Jianglu
    DISCRETE MATHEMATICS, 2008, 308 (18) : 4280 - 4285
  • [24] Hamiltonicity of 2-connected {K1,4, K1,4 + e]-free graphs
    Li, R
    DISCRETE MATHEMATICS, 2004, 287 (1-3) : 69 - 76
  • [25] Spanning trees of K1,4-free graphs whose reducible stems have few leaves
    Ha, Pham Hoang
    Nam, Le Dinh
    Pham, Ngoc Diep
    PERIODICA MATHEMATICA HUNGARICA, 2024, 89 (01) : 61 - 71
  • [26] Note on the Longest Paths in {K1,4,K1,4+e}-free Graphs
    Fang DUAN
    Guo Ping WANG
    Acta Mathematica Sinica,English Series, 2012, (12) : 2501 - 2506
  • [27] Conditions for Implicit-Degree Sum for Spanning Trees with Few Leaves in K1,4-Free Graphs
    Cai, Junqing
    Lin, Cheng-Kuan
    Sun, Qiang
    Wang, Panpan
    MATHEMATICS, 2023, 11 (24)
  • [28] Disjoint K1,4 in claw-free graphs with minimum degree at least four∗
    1600, Charles Babbage Research Centre (103):
  • [29] PTAS for the minimum k-path connected vertex cover problem in unit disk graphs
    Liu, Xianliang
    Lu, Hongliang
    Wang, Wei
    Wu, Weili
    JOURNAL OF GLOBAL OPTIMIZATION, 2013, 56 (02) : 449 - 458
  • [30] PTAS for the minimum k-path connected vertex cover problem in unit disk graphs
    Xianliang Liu
    Hongliang Lu
    Wei Wang
    Weili Wu
    Journal of Global Optimization, 2013, 56 : 449 - 458
1234