Reducing the Vertex Cover Number via Edge Contractions

02/07/2022
by   Paloma T. Lima, et al.
0

The CONTRACTION(vc) problem takes as input a graph G on n vertices and two integers k and d, and asks whether one can contract at most k edges to reduce the size of a minimum vertex cover of G by at least d. Recently, Lima et al. [JCSS 2021] proved, among other results, that unlike most of the so-called blocker problems, CONTRACTION(vc) admits an XP algorithm running in time f(d) · n^O(d). They left open the question of whether this problem is FPT under this parameterization. In this article, we continue this line of research and prove the following results: 1. CONTRACTION(vc) is W[1]-hard parameterized by k + d. Moreover, unless the ETH fails, the problem does not admit an algorithm running in time f(k + d) · n^o(k + d) for any function f. In particular, this answers the open question stated in Lima et al. [JCSS 2021] in the negative. 2. It is NP-hard to decide whether an instance (G, k, d) of CONTRACTION(vc) is a yes-instance even when k = d, hence enhancing our understanding of the classical complexity of the problem. 3. CONTRACTION(vc) can be solved in time 2^O(d)· n^k - d + O(1). This XP algorithm improves the one of Lima et al. [JCSS 2021], which uses Courcelle's theorem as a subroutine and hence, the f(d)-factor in the running time is non-explicit and probably very large. On the other hard, it shows that when k=d, the problem is FPT parameterized by d (or by k).

READ FULL TEXT

page 3

page 7

page 11

page 15

page 17

page 21

page 33

page 35

research
08/18/2020

On the Parameterized Complexity Of Grid Contraction

For a family of graphs 𝒢, the 𝒢-Contraction problem takes as an input a ...
research
05/04/2020

Reducing graph transversals via edge contractions

For a graph parameter π, the Contraction(π) problem consists in, given a...
research
02/03/2014

Customizable Contraction Hierarchies

We consider the problem of quickly computing shortest paths in weighted ...
research
02/28/2023

Parameterized Complexity of Vertex Splitting to Pathwidth at most 1

Motivated by the planarization of 2-layered straight-line drawings, we c...
research
09/24/2020

On the Parameterized Complexity of Maximum Degree Contraction Problem

In the Maximum Degree Contraction problem, input is a graph G on n verti...
research
11/30/2019

Inapproximability of Additive Weak Contraction under SSEH and Strong UGC

Succinct representations of a graph have been objects of central study i...
research
02/18/2020

Building large k-cores from sparse graphs

A popular model to measure network stability is the k-core, that is the ...

Please sign up or login with your details

Forgot password? Click here to reset