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

Nicolas Bousquet, Amer E. Mouawad, Naomi Nishimura +1

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…