TY - UNPB

T1 - l-path vertex cover is easier than l-hitting set for small l.

AU - Tsur, Dekel

N1 - DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2019

Y1 - 2019

N2 - In the l-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 G−S does not contain a path with l vertices. In this paper we give parameterized algorithms for l-path vertex cover for l=5,6,7, whose time complexities are O∗(3.945k), O∗(4.947k), and O∗(5.951k), respectively.

AB - In the l-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 G−S does not contain a path with l vertices. In this paper we give parameterized algorithms for l-path vertex cover for l=5,6,7, whose time complexities are O∗(3.945k), O∗(4.947k), and O∗(5.951k), respectively.

M3 - Preprint

BT - l-path vertex cover is easier than l-hitting set for small l.

ER -