Parameterized algorithm for 3-path vertex cover
Data Structures and Algorithms
2018-09-11 v1
Abstract
In the 3-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 3 vertices in contains at least one vertex of . In this paper we give parameterized algorithm for 3-path cover whose time complexity is . Our algorithm is faster than previous algorithms for this problem.
Cite
@article{arxiv.1809.02636,
title = {Parameterized algorithm for 3-path vertex cover},
author = {Dekel Tsur},
journal= {arXiv preprint arXiv:1809.02636},
year = {2018}
}