A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
SIAM Journal on Discrete Mathematics
Graph Theory With Applications
Graph Theory With Applications
A factor 2 approximation algorithm for the vertex cover P3 problem
Information Processing Letters
Discrete Applied Mathematics
Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
Information Processing Letters
On computing the minimum 3-path vertex cover and dissociation number of graphs
Theoretical Computer Science
A primal-dual approximation algorithm for the vertex cover P3 problem
Theoretical Computer Science
| Hi-index | 0.89 |
A subset F of vertices of a graph G is called a vertex cover P"k set if every path of order k in G contains at least one vertex from F. Denote by @j"k(G) the minimum cardinality of a vertex cover P"k set in G. The vertex cover P"k (VCP"k) problem is to find a minimum vertex cover P"k set. In this paper, we restrict our attention to the VCP"3 problem in cubic graphs. This paper proves that the VCP"3 problem is NP-hard for cubic planar graphs of girth 3. Further we give sharp lower and upper bounds on @j"3(G) for cubic graphs and propose a 1.57-approximation algorithm for the VCP"3 problem in cubic graphs.