Reconfiguration of steiner trees in an unweighted graph

Haruka Mizuta, Takehiro Ito, Xiao Zhou

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationCombinatorial Algorithms - 27th International Workshop, IWOCA 2016, Proceedings
EditorsVeli Mäkinen, Simon J. Puglisi, Leena Salmela
PublisherSpringer Verlag
Number of pages13
ISBN (Print)9783319445427
Publication statusPublished - 2016
Event27th International Workshop on Combinatorial Algorithms, IWOCA 2016 - Helsinki, Finland
Duration: 2016 Aug 172016 Aug 19

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9843 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference27th International Workshop on Combinatorial Algorithms, IWOCA 2016


Dive into the research topics of 'Reconfiguration of steiner trees in an unweighted graph'. Together they form a unique fingerprint.

Cite this