A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems
[article]

2022
*
arXiv
*
pre-print

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 the graph. A reconfiguration variant of a vertex-subset problem asks, given two feasible solutions of size k, whether it is possible to transform one into the other by a sequence of token slides (along edges of the graph) or token jumps (between arbitrary vertices of the graph) such that each intermediate set

arXiv:2204.10526v1
fatcat:ua3pkqxtabatbbl6jydhy3i3b4