Generating faster algorithms for d-Path Vertex Cover
share
For a constant d, the d-Path Vertex Cover problem (d-PVC) is as follows: Given an undirected graph and an integer k, find a subset of at most k vertices of the graph, such that their deletion results in a graph not containing a path on d vertices as a subgraph. We develop a framework to automatically generate parameterized branching algorithms for the problem and obtain algorithms outperforming those previously known for 3 ≤ d ≤ 8. E.g., we show that 5-PVC can be solved in O(2.7^k· n^O(1)) time.
READ FULL TEXT