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

06/22/2019
by   Dekel Tsur, et al.
0

In the l-path vertex cover problem the input is an undirected graph G and an integer k. The goal is to decide whether there is a set of vertices S of size at most k such that G-S does not contain a path with l vertices. In this paper we give parameterized algorithms for l-path vertex cover for l = 5,6,7, whose time complexities are O^*(3.945^k), O^*(4.947^k), and O^*(5.951^k), respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2018

An O^*(2.619^k) algorithm for 4-path vertex cover

In the 4-path vertex cover problem, the input is an undirected graph G a...
research
11/10/2021

Generating faster algorithms for d-Path Vertex Cover

For a constant d, the d-Path Vertex Cover problem (d-PVC) is as follows:...
research
07/26/2021

On Kernels for d-Path Vertex Cover

In this paper we study the kernelization of d-Path Vertex Cover (d-PVC) ...
research
12/02/2020

Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation

In this paper, we show that Bandwidth is hard for the complexity class W...
research
02/11/2019

A Simple Gap-producing Reduction for the Parameterized Set Cover Problem

Given an n-vertex bipartite graph I=(S,U,E), the goal of set cover probl...
research
05/07/2020

Neighbourhood Evaluation Criteria for Vertex Cover Problem

Neighbourhood Evaluation Criteria is a heuristical approximate algorithm...
research
05/16/2022

A faster algorithm for Vertex Cover parameterized by solution size

We describe a new algorithm for vertex cover with runtime O^*(1.25400^k)...

Please sign up or login with your details

Forgot password? Click here to reset