An O^*(2.619^k) algorithm for 4-path vertex cover
Data Structures and Algorithms
2019-01-08 v2
Abstract
In the 4-path vertex cover problem, the input is an undirected graph and an integer . The goal is to decide whether there is a set of vertices of size at most such that every path with 4 vertices in contains at least one vertex of . In this paper we give a parameterized algorithm for 4-path vertex cover whose time complexity is .
Cite
@article{arxiv.1811.03592,
title = {An O^*(2.619^k) algorithm for 4-path vertex cover},
author = {Dekel Tsur},
journal= {arXiv preprint arXiv:1811.03592},
year = {2019}
}