论文信息 - Reconfiguration of Steiner Trees in an Unweighted Graph

Reconfiguration of Steiner Trees in an Unweighted Graph

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.

[1] Takehiro Ito,et al. Reconfiguration of Vertex Covers in a Graph , 2016 .

[2] Christos H. Papadimitriou,et al. The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies , 2006, SIAM J. Comput..

[3] Naomi Nishimura,et al. Vertex Cover Reconfiguration and Beyond , 2014, ISAAC.

[4] Martin Milanic,et al. Complexity of independent set reconfigurability problems , 2012, Theor. Comput. Sci..

[5] Yota Otachi,et al. Reconfiguration of Cliques in a Graph , 2014, TAMC.

[6] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[7] Takehiro Ito,et al. On the complexity of reconfiguration problems , 2011, Theor. Comput. Sci..

[8] Naomi Nishimura,et al. Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas , 2015, ICALP.

[9] Rolf H. Möhring,et al. An Incremental Linear-Time Algorithm for Recognizing Interval Graphs , 1989, SIAM J. Comput..

[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11] Jan van den Heuvel,et al. The complexity of change , 2013, Surveys in Combinatorics.

[12] Yota Otachi,et al. Linear-time algorithm for sliding tokens on trees , 2014, Theor. Comput. Sci..