Parameterized algorithm for 3-path vertex cover
Dekel Tsur

TL;DR
This paper presents a faster parameterized algorithm for the 3-path vertex cover problem, reducing the time complexity to improve efficiency in solving this graph problem.
Contribution
The paper introduces a new parameterized algorithm with improved time complexity for the 3-path vertex cover problem.
Findings
Algorithm runs in $O^*(1.713^k)$ time
Faster than previous algorithms for the same problem
Provides a more efficient solution for 3-path vertex cover
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
