TY - UNPB

T1 - Above guarantee parameterization for vertex cover on graphs with maximum degree 4.

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 - 2018

Y1 - 2018

N2 - In the vertex cover problem, the input is a graph G and an integer k, and the goal is to decide whether there is a set of vertices S of size at most k such that every edge of G is incident on at least one vertex in S. We study the vertex cover problem on graphs with maximum degree 4 and minimum degree at least 2, parameterized by r=k−n/3. We give an algorithm for this problem whose running time is O∗(1.6253r). As a corollary, we obtain an O∗(1.2403k)-time algorithm for vertex cover on graphs with maximum degree 4.

AB - In the vertex cover problem, the input is a graph G and an integer k, and the goal is to decide whether there is a set of vertices S of size at most k such that every edge of G is incident on at least one vertex in S. We study the vertex cover problem on graphs with maximum degree 4 and minimum degree at least 2, parameterized by r=k−n/3. We give an algorithm for this problem whose running time is O∗(1.6253r). As a corollary, we obtain an O∗(1.2403k)-time algorithm for vertex cover on graphs with maximum degree 4.

M3 - Preprint

BT - Above guarantee parameterization for vertex cover on graphs with maximum degree 4.

ER -