An O^*(2.619^k) algorithm for 4-path vertex cover

11/08/2018

∙

by   Dekel Tsur, et al.

∙

0

∙

share

In the 4-path vertex cover problem, the input is an undirected graph G and an integer k. The goal is to decide whether there is a set of vertices S of size at most k such that every path with 4 vertices in G contains at least one vertex of S. In this paper we give a parameterized algorithm for 4-path vertex cover whose time complexity is O^*(2.619^k).