Reconfiguration of Steiner Trees in an Unweighted Graph

Conference paper

DOI: 10.1007/978-3-319-44543-4_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9843)
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.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Graduate School of Information SciencesTohoku UniversitySendaiJapan
  2. 2.JST, ERATO, Kawarabayashi Large Graph ProjectTokyoJapan
  3. 3.CREST, JST, 4-1-8 HonchoKawaguchiJapan

Personalised recommendations