Reconfiguration of minimum steiner trees via vertex exchanges

Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019
EditorsJoost-Pieter Katoen, Pinar Heggernes, Peter Rossmanith
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771177
DOIs
Publication statusPublished - 2019 Aug
Event44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019 - Aachen, Germany
Duration: 2019 Aug 262019 Aug 30

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume138
ISSN (Print)1868-8969

Conference

Conference44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019
CountryGermany
CityAachen
Period19/8/2619/8/30

Keywords

  • Combinatorial reconfiguration
  • Graph algorithms
  • Steiner tree

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Reconfiguration of minimum steiner trees via vertex exchanges'. Together they form a unique fingerprint.

Cite this