Reconfiguring Directed Trees in a Digraph
share
In this paper, we investigate the computational complexity of subgraph reconfiguration problems in directed graphs. More specifically, we focus on the problem of determining whether, given two directed trees in a digraph, there is a (reconfiguration) sequence of directed trees such that for every pair of two consecutive trees in the sequence, one of them is obtained from the other by removing an arc and then adding another arc. We show that this problem can be solved in polynomial time, whereas the problem is PSPACE-complete when we restrict directed trees in a reconfiguration sequence to form directed paths. We also show that there is a polynomial-time algorithm for finding a shortest reconfiguration sequence between two directed spanning trees.
READ FULL TEXT