The tape reconfiguration problem and its consequences for dominating set reconfiguration

Nicolas Bousquet, Quentin Deschamps, Arnaud Mary +2

A dominating set of a graph $G=(V,E)$ is a set of vertices $D\subseteq V$ whose closed neighborhood is $V$, i.e., $N[D]=V$. We view a dominating set as a collection of tokens plac…