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 条

[1] Path Cover in K1,4-Free Graphs
Mingda LIU
Xiaodong CHEN
Mingchu LI
JournalofMathematicalResearchwithApplications, 2019, 39 (03) : 315 - 320
[2] Vertex-disjoint K1 + (K1 ∪ K2) in K1,4-free graphs with minimum degree at least four
Yun Shu Gao
Qing Song Zou
Acta Mathematica Sinica, English Series, 2014, 30 : 661 - 674
[3] On hamiltonian connectedness of K1,4-free graphs
Li, MC
DISCRETE MATHEMATICS, 2000, 216 (1-3) : 279 - 285
[4] Vertex-disjoint K1 + (K1 ∨ K2) in K 1,4-free Graphs with Minimum Degree at Least Four
Gao, Yun Shu
Zou, Qing Song
ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2014, 30 (04) : 661 - 674
[5] Vertex-disjoint K1+（K1 ∪ K2） in K1,4-free Graphs with Minimum Degree at Least Four
Yun Shu GAO
Qing Song ZOU
Acta Mathematica Sinica(English Series), 2014, 30 (04) : 661 - 674
[6] Cyclability in k-connected K1,4-free graphs
Flandrin, Evelyne
Gyori, Ervin
Li, Hao
Shu, Jinlong
DISCRETE MATHEMATICS, 2010, 310 (20) : 2735 - 2741
[7] Pancyclicity mod k of claw-free graphs and K1,4-free graphs
Cai, XT
Shreve, WE
DISCRETE MATHEMATICS, 2001, 230 (1-3) : 113 - 118
[8] Spanning trees with at most k leaves in K1,4-free graphs
Kyaw, Aung
DISCRETE MATHEMATICS, 2011, 311 (20) : 2135 - 2142
[9] Complexity and algorithms for the connected vertex cover problem in 4-regular graphs
Li, Yuchao
Yang, Zishen
Wang, Wei
APPLIED MATHEMATICS AND COMPUTATION, 2017, 301 : 107 - 114
[10] Spanning trees with at most 3 leaves in K1,4-free graphs
Kyaw, Aung
DISCRETE MATHEMATICS, 2009, 309 (20) : 6146 - 6148

← 1 2 3 4 →