Reflexive Digraph Reconfiguration by Orientation Strings

The reconfiguration problem for homomorphisms of digraphs to a reflexive digraph cycle, which amounts to deciding if a `reconfiguration graph' is connected, is known to by polynomially time solvable via a greedy algorithm based on certain topological requirements. Even in the case that the instance digraph is a cycle of length $m$, the algorithm, being greedy, takes time $\Omega(m^2)$. Encoding homomorphisms between two cycles as a relation on strings that represent the orientations of the cycles, we give a characterization of the components of the reconfiguration graph that can be computed in linear time and logarithmic space. In particular, this solves the reconfiguration problem for homomorphisms of cycles to cycles in log-space.