Generating faster algorithms for d-Path Vertex Cover

11/10/2021
by   Radovan Červený, et al.
0

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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/07/2018

Parameterized algorithm for 3-path vertex cover

In the 3-path vertex cover problem, the input is an undirected graph G a...
06/22/2019

l-path vertex cover is easier than l-hitting set for small l

In the l-path vertex cover problem the input is an undirected graph G an...
04/18/2019

New Subgraph Isomorphism Algorithms: Vertex versus Path-at-a-time Matching

Graphs are widely used to model complicated data semantics in many appli...
01/16/2020

Tourneys and the Fast Generation and Obfuscation of Closed Knight's Tours

New algorithms for generating closed knight's tours are obtained by gene...
01/14/2022

The Parameterized Complexity of s-Club with Triangle and Seed Constraints

The s-Club problem asks, for a given undirected graph G, whether G conta...
03/04/2019

An application of the Gyárfás path argument

We adapt the Gyárfás path argument to prove that t-2 cops can capture a ...
07/15/2020

On the parameterized complexity of the Minimum Path Cover problem in DAGs

A minimum path cover (MPC) of a directed acyclic graph (DAG) G = (V,E) i...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.