On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets

by   Daniel Lokshtanov, et al.

In a reconfiguration version of an optimization problem Q the input is an instance of Q and two feasible solutions S and T. The objective is to determine whether there exists a step-by-step transformation between S and T such that all intermediate steps also constitute feasible solutions. In this work, we study the parameterized complexity of the Connected Dominating Set Reconfiguration problem (CDS-R). It was shown in previous work that the Dominating Set Reconfiguration problem (DS-R) parameterized by k, the maximum allowed size of a dominating set in a reconfiguration sequence, is fixed-parameter tractable on all graphs that exclude a biclique K_d,d as a subgraph, for some constant d ≥ 1. We show that the additional connectivity constraint makes the problem much harder, namely, that CDS-R is W[1]-hard parameterized by k+ℓ, the maximum allowed size of a dominating set plus the length of the reconfiguration sequence, already on 5-degenerate graphs. On the positive side, we show that CDS-R parameterized by k is fixed-parameter tractable, and in fact admits a polynomial kernel on planar graphs.



There are no comments yet.


page 3


On the tractability of optimization problems on H-graphs

For a graph H, a graph G is an H-graph if it is an intersection graph of...

On Kernelization for Edge Dominating Set under Structural Parameters

In the NP-hard Edge Dominating Set problem (EDS) we are given a graph G=...

Parameterized algorithms for locating-dominating sets

A locating-dominating set D of a graph G is a dominating set of G where ...

Decremental Optimization of Dominating Sets Under Reachability Constraints

Given a dominating set, how much smaller a dominating set can we find th...

Linear transformations between dominating sets in the TAR-model

Given a graph G and an integer k, a token addition and removal (TAR for ...

The Longest Run Subsequence Problem: Further Complexity Results

Longest Run Subsequence is a problem introduced recently in the context ...

Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree

A heapable sequence is a sequence of numbers that can be arranged in a "...
This week in AI

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