547 research outputs found
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets
In a reconfiguration version of a decision problem ? the input is an instance of ? 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
Reconfiguration on sparse graphs
A vertex-subset graph problem Q defines which subsets of the vertices of an
input graph are feasible solutions. A reconfiguration variant of a
vertex-subset problem asks, given two feasible solutions S and T of size k,
whether it is possible to transform S into T by a sequence of vertex additions
and deletions such that each intermediate set is also a feasible solution of
size bounded by k. We study reconfiguration variants of two classical
vertex-subset problems, namely Independent Set and Dominating Set. We denote
the former by ISR and the latter by DSR. Both ISR and DSR are PSPACE-complete
on graphs of bounded bandwidth and W[1]-hard parameterized by k on general
graphs. We show that ISR is fixed-parameter tractable parameterized by k when
the input graph is of bounded degeneracy or nowhere-dense. As a corollary, we
answer positively an open question concerning the parameterized complexity of
the problem on graphs of bounded treewidth. Moreover, our techniques generalize
recent results showing that ISR is fixed-parameter tractable on planar graphs
and graphs of bounded degree. For DSR, we show the problem fixed-parameter
tractable parameterized by k when the input graph does not contain large
bicliques, a class of graphs which includes graphs of bounded degeneracy and
nowhere-dense graphs
Reconfiguration of Dominating Sets
We explore a reconfiguration version of the dominating set problem, where a
dominating set in a graph is a set of vertices such that each vertex is
either in or has a neighbour in . In a reconfiguration problem, the goal
is to determine whether there exists a sequence of feasible solutions
connecting given feasible solutions and such that each pair of
consecutive solutions is adjacent according to a specified adjacency relation.
Two dominating sets are adjacent if one can be formed from the other by the
addition or deletion of a single vertex.
For various values of , we consider properties of , the graph
consisting of a vertex for each dominating set of size at most and edges
specified by the adjacency relation. Addressing an open question posed by Haas
and Seyffarth, we demonstrate that is not necessarily
connected, for the maximum cardinality of a minimal dominating set
in . The result holds even when graphs are constrained to be planar, of
bounded tree-width, or -partite for . Moreover, we construct an
infinite family of graphs such that has exponential
diameter, for the minimum size of a dominating set. On the positive
side, we show that is connected and of linear diameter for any
graph on vertices having at least independent edges.Comment: 12 pages, 4 figure
Token Jumping in minor-closed classes
Given two -independent sets and of a graph , one can ask if it
is possible to transform the one into the other in such a way that, at any
step, we replace one vertex of the current independent set by another while
keeping the property of being independent. Deciding this problem, known as the
Token Jumping (TJ) reconfiguration problem, is PSPACE-complete even on planar
graphs. Ito et al. proved in 2014 that the problem is FPT parameterized by
if the input graph is -free.
We prove that the result of Ito et al. can be extended to any
-free graphs. In other words, if is a -free
graph, then it is possible to decide in FPT-time if can be transformed into
. As a by product, the TJ-reconfiguration problem is FPT in many well-known
classes of graphs such as any minor-free class
Parameterized Complexity of Graph Constraint Logic
Graph constraint logic is a framework introduced by Hearn and Demaine, which
provides several problems that are often a convenient starting point for
reductions. We study the parameterized complexity of Constraint Graph
Satisfiability and both bounded and unbounded versions of Nondeterministic
Constraint Logic (NCL) with respect to solution length, treewidth and maximum
degree of the underlying constraint graph as parameters. As a main result we
show that restricted NCL remains PSPACE-complete on graphs of bounded
bandwidth, strengthening Hearn and Demaine's framework. This allows us to
improve upon existing results obtained by reduction from NCL. We show that
reconfiguration versions of several classical graph problems (including
independent set, feedback vertex set and dominating set) are PSPACE-complete on
planar graphs of bounded bandwidth and that Rush Hour, generalized to boards, is PSPACE-complete even when is at most a constant
Parameterized Complexities of Dominating and Independent Set Reconfiguration
We settle the parameterized complexities of several variants of independent
set reconfiguration and dominating set reconfiguration, parameterized by the
number of tokens. We show that both problems are XL-complete when there is no
limit on the number of moves and XNL-complete when a maximum length for
the sequence is given in binary in the input. The problems are known to be
XNLP-complete when is given in unary instead, and - and
-hard respectively when is also a parameter. We complete the
picture by showing membership in those classes.
Moreover, we show that for all the variants that we consider, token sliding
and token jumping are equivalent under pl-reductions. We introduce partitioned
variants of token jumping and token sliding, and give pl-reductions between the
four variants that have precise control over the number of tokens and the
length of the reconfiguration sequence.Comment: 31 pages, 3 figure
Reconfiguring Independent Sets in Claw-Free Graphs
We present a polynomial-time algorithm that, given two independent sets in a
claw-free graph , decides whether one can be transformed into the other by a
sequence of elementary steps. Each elementary step is to remove a vertex
from the current independent set and to add a new vertex (not in )
such that the result is again an independent set. We also consider the more
restricted model where and have to be adjacent
The complexity of dominating set reconfiguration
Suppose that we are given two dominating sets and of a graph
whose cardinalities are at most a given threshold . Then, we are asked
whether there exists a sequence of dominating sets of between and
such that each dominating set in the sequence is of cardinality at most
and can be obtained from the previous one by either adding or deleting
exactly one vertex. This problem is known to be PSPACE-complete in general. In
this paper, we study the complexity of this decision problem from the viewpoint
of graph classes. We first prove that the problem remains PSPACE-complete even
for planar graphs, bounded bandwidth graphs, split graphs, and bipartite
graphs. We then give a general scheme to construct linear-time algorithms and
show that the problem can be solved in linear time for cographs, trees, and
interval graphs. Furthermore, for these tractable cases, we can obtain a
desired sequence such that the number of additions and deletions is bounded by
, where is the number of vertices in the input graph
- …