On the Parameterized Approximability of Contraction to Classes of Chordal Graphs

by   Spoorthy Gunda, et al.

A graph operation that contracts edges is one of the fundamental operations in the theory of graph minors. Parameterized Complexity of editing to a family of graphs by contracting k edges has recently gained substantial scientific attention, and several new results have been obtained. Some important families of graphs, namely the subfamilies of chordal graphs, in the context of edge contractions, have proven to be significantly difficult than one might expect. In this paper, we study the F-Contraction problem, where F is a subfamily of chordal graphs, in the realm of parameterized approximation. Formally, given a graph G and an integer k, F-Contraction asks whether there exists X ⊆ E(G) such that G/X ∈ F and |X| ≤ k. Here, G/X is the graph obtained from G by contracting edges in X. We obtain the following results for the F-Contraction problem. (1) We show that Clique Contraction admits a polynomial-size approximate kernelization scheme (PSAKS). (2) We give a (2+ϵ)-approximate polynomial kernel for Split Contraction (which also implies a factor (2+ϵ)--approximation algorithm for Split Contraction). Furthermore, we show that, assuming Gap-ETH, there is no (5/4-δ)--approximation algorithm for Split Contraction. Here, ϵ, δ>0 are fixed constants. (3) Chordal Contraction is known to be . We complement this result by observing that the existing W[2]-hardness reduction can be adapted to show that, assuming ≠ W[1], there is no F(k)--approximation algorithm for Chordal Contraction. Here, F(k) is an arbitrary function depending on k alone.


page 1

page 2

page 3

page 4


On the Parameterized Complexity Of Grid Contraction

For a family of graphs 𝒢, the 𝒢-Contraction problem takes as an input a ...

Contraction Bidimensionality of Geometric Intersection Graphs

Given a graph G, we define bcg(G) as the minimum k for which G can be co...

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction

In this work, we initiate the complexity study of Biclique Contraction a...

Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number

We consider the following problem: for a given graph G and two integers ...

Contracting edges to destroy a pattern: A complexity study

Given a graph G and an integer k, the objective of the Π-Contraction pro...

The Maximum Matrix Contraction Problem

In this paper, we introduce the Maximum Matrix Contraction problem, wher...

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View

In the Steiner Tree problem we are given an edge weighted undirected gra...

Please sign up or login with your details

Forgot password? Click here to reset