On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets

Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan +1

In a reconfiguration version of an optimization problem $\mathcal{Q}$ the input is an instance of $\mathcal{Q}$ and two feasible solutions $S$ and $T$. The objective is to determin…