A survey on the parameterized complexity of reconfiguration problems
A graph vertex-subset problem defines which subsets of the vertices of an input graph are
feasible solutions. We view a feasible solution as a set of tokens placed on the vertices of …
feasible solutions. We view a feasible solution as a set of tokens placed on the vertices of …
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems
N Bousquet, AE Mouawad, N Nishimura… - ar** and not-so-
well known problem (s), which we call, Half (Induced-) Subgraph, and show that under Gap …
well known problem (s), which we call, Half (Induced-) Subgraph, and show that under Gap …
Combinatorial and Algorithmic aspects of Reconfiguration
V Bartier - 2021 - theses.hal.science
Combinatorial reconfiguration problems consist in finding step-by-step transformations
between two feasible solutions of an optimization problem, called the source problem, in …
between two feasible solutions of an optimization problem, called the source problem, in …
Reconfiguration Using Generalized Token Jum**
JM Křišťan, J Svoboda - arxiv preprint arxiv:2411.12582, 2024 - arxiv.org
In reconfiguration, we are given two solutions to a graph problem, such as Vertex Cover or
Dominating Set, with each solu tion represented by a placement of tokens on vertices of the …
Dominating Set, with each solu tion represented by a placement of tokens on vertices of the …