TY - GEN
T1 - Reconfiguration of steiner trees in an unweighted graph
AU - Mizuta, Haruka
AU - Ito, Takehiro
AU - Zhou, Xiao
N1 - Funding Information:
JSPS KAKENHI Grant Numbers 15H00849 and 16K00004 (T. Ito), and 16K00003 (X. Zhou).
Publisher Copyright:
© Springer International Publishing Switzerland 2016.
PY - 2016
Y1 - 2016
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84984918702&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84984918702&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-44543-4_13
DO - 10.1007/978-3-319-44543-4_13
M3 - Conference contribution
AN - SCOPUS:84984918702
SN - 9783319445427
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 163
EP - 175
BT - Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Proceedings
A2 - Mäkinen, Veli
A2 - Puglisi, Simon J.
A2 - Salmela, Leena
PB - Springer Verlag
T2 - 27th International Workshop on Combinatorial Algorithms, IWOCA 2016
Y2 - 17 August 2016 through 19 August 2016
ER -