Reconfiguration of Steiner Trees in an Unweighted Graph
- First Online:
- Cite this paper as:
- Mizuta H., Ito T., Zhou X. (2016) Reconfiguration of Steiner Trees in an Unweighted Graph. In: Mäkinen V., Puglisi S., Salmela L. (eds) Combinatorial Algorithms. IWOCA 2016. Lecture Notes in Computer Science, vol 9843. Springer, Cham
We study a reconfiguration problem for Steiner trees in an unweighted graph, which determines whether there exists a sequence of Steiner trees that transforms a given Steiner tree into another one by exchanging a single edge at a time. In this paper, we show that the problem is PSPACE-complete even for split graphs (and hence for chordal graphs), while solvable in linear time for interval graphs.