Reconfiguration of Steiner Trees in an Unweighted Graph

Haruka MIZUTA  Takehiro ITO  Xiao ZHOU  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E100-A   No.7   pp.1532-1540
Publication Date: 2017/07/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E100.A.1532
Type of Manuscript: PAPER
Category: Algorithms and Data Structures
cograph,  combinatorial reconfiguration,  interval graph,  PSPACE-complete,  split graph,  Steiner tree,  

Full Text: PDF>>
Buy this Article

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, while solvable in linear time for interval graphs and for cographs.