Kernelization and Parameterized Algorithms for 3-Path Vertex Cover

Abstract

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$. In this paper, we give a kernel of $5k$ vertices and an $O^{\ast }(1.7485^k)$-time and polynomial-space algorithm for this problem, both new results improve previous known bounds.

in TAMC 2016, LNCS 9796, 2016

References in corpus (3)

• Minimum k-path vertex cover
• On a generalization of Nemhauser and Trotter's local optimization theorem
• A Parameterized Algorithm for Bounded-Degree Vertex Deletion

Cited by in corpus (3)

• l-path vertex cover is easier than l-hitting set for small l
• An O^*(2.619^k) algorithm for 4-path vertex cover
• A $5k$-vertex Kernel for $P_2$-packing