TY - GEN

T1 - Reconfiguration of minimum steiner trees via vertex exchanges

AU - Mizuta, Haruka

AU - Hatanaka, Tatsuhiko

AU - Ito, Takehiro

AU - Zhou, Xiao

PY - 2019/8

Y1 - 2019/8

N2 - In this paper, we study the problem of deciding if there is a transformation between two given minimum Steiner trees of an unweighted graph such that each transformation step respects a prescribed reconfiguration rule and results in another minimum Steiner tree of the graph. We consider two reconfiguration rules, both of which exchange a single vertex at a time, and generalize the known reconfiguration problem for shortest paths in an unweighted graph. This generalization implies that our problems under both reconfiguration rules are PSPACE-complete for bipartite graphs. We thus study the problems with respect to graph classes, and give some boundaries between the polynomial-time solvable and PSPACE-complete cases.

AB - In this paper, we study the problem of deciding if there is a transformation between two given minimum Steiner trees of an unweighted graph such that each transformation step respects a prescribed reconfiguration rule and results in another minimum Steiner tree of the graph. We consider two reconfiguration rules, both of which exchange a single vertex at a time, and generalize the known reconfiguration problem for shortest paths in an unweighted graph. This generalization implies that our problems under both reconfiguration rules are PSPACE-complete for bipartite graphs. We thus study the problems with respect to graph classes, and give some boundaries between the polynomial-time solvable and PSPACE-complete cases.

KW - Combinatorial reconfiguration

KW - Graph algorithms

KW - Steiner tree

UR - http://www.scopus.com/inward/record.url?scp=85071765701&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85071765701&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.MFCS.2019.79

DO - 10.4230/LIPIcs.MFCS.2019.79

M3 - Conference contribution

AN - SCOPUS:85071765701

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019

A2 - Katoen, Joost-Pieter

A2 - Heggernes, Pinar

A2 - Rossmanith, Peter

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019

Y2 - 26 August 2019 through 30 August 2019

ER -