Abstract
A 3-path vertex cover in a graph is a vertex subset C such that every path of three vertices contains at least one vertex from C. The parameterized 3-path vertex cover problem asks whether a graph has a 3-path vertex cover of size at most k. In this paper, we give a kernel of 5 k vertices and an O* (1.7485k)-time algorithm for this problem, both new results improve previous known bounds.
Cite
CITATION STYLE
Xiao, M., & Kou, S. (2017). Kernelization and parameterized algorithms for 3-path vertex cover. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10185 LNCS, pp. 654–668). Springer Verlag. https://doi.org/10.1007/978-3-319-55911-7_47
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
