3 papers
cs.DS2021
Generating faster algorithms for d-Path Vertex Cover
Radovan Červený, Ondřej Suchý
Many algorithms which exactly solve hard problems require branching on more or less complex structures in order to do their job. Those who design such algorithms often find themsel…
cs.DS2021
On Kernels for d-Path Vertex Cover
Radovan Červený, Pratibha Choudhary, Ondřej Suchý
In this paper we study the kernelization of the -Path Vertex Cover (-PVC) problem. Given a graph , the problem requires finding whether there exists a set of at most v…
cs.DS2019
Faster FPT Algorithm for 5-Path Vertex Cover
Radovan Červený, Ondřej Suchý
The problem of -Path Vertex Cover, -PVC lies in determining a subset of vertices of a given graph such that does not contain a path on verti…