Reconfiguration of minimum steiner trees via vertex exchanges

Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトル44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019
編集者Joost-Pieter Katoen, Pinar Heggernes, Peter Rossmanith
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959771177
DOI
出版ステータスPublished - 2019 8
イベント44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019 - Aachen, Germany
継続期間: 2019 8 262019 8 30

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
138
ISSN(印刷版)1868-8969

Conference

Conference44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019
国/地域Germany
CityAachen
Period19/8/2619/8/30

ASJC Scopus subject areas

  • ソフトウェア

フィンガープリント

「Reconfiguration of minimum steiner trees via vertex exchanges」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル