Document Open Access Logo

Reconfiguration of Minimum Steiner Trees via Vertex Exchanges

Authors Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito , Xiao Zhou

PDF

File

Thumbnail PDF
PDF
LIPIcs.MFCS.2019.79.pdf
  • Filesize: 0.49 MB
  • 11 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph algorithms
Keywords
  • Combinatorial reconfiguration
  • Graph algorithms
  • Steiner tree

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

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.

Cite As Get BibTex

Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, and Xiao Zhou. Reconfiguration of Minimum Steiner Trees via Vertex Exchanges. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 79:1-79:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019) https://doi.org/10.4230/LIPIcs.MFCS.2019.79

Author Details

Haruka Mizuta
  • Graduate School of Information Sciences, Tohoku University, Sendai, Japan
Tatsuhiko Hatanaka
  • Graduate School of Information Sciences, Tohoku University, Sendai, Japan
Takehiro Ito
  • Graduate School of Information Sciences, Tohoku University, Sendai, Japan
Xiao Zhou
  • Graduate School of Information Sciences, Tohoku University, Sendai, Japan

Funding

  • Mizuta, Haruka: Partially supported by JSPS KAKENHI Grant Number JP19J10042, Japan.
  • Ito, Takehiro: Partially supported by JST CREST Grant Number JPMJCR1402, and JSPS KAKENHI Grant Numbers JP18H04091 and JP19K11814, Japan.
  • Zhou, Xiao: Partially supported by JSPS KAKENHI Grant Number JP19K11813, Japan.

References

  1. P. Bonsma. The complexity of rerouting shortest paths. Theoretical Computer Science, 510:1-12, 2013. Google Scholar
  2. P. Bonsma. Rerouting shortest paths in planar graphs. Discrete Applied Mathematics, 231:95-112, 2017. Google Scholar
  3. A. Brandstädt, V.B. Le, and J.P. Spinrad. Graph Classes: A Survey. SIAM, Philadelphia, PA, 1999. Google Scholar
  4. T. Hanaka, T. Ito, H. Mizuta, B. Moore, N. Nishimura, V. Subramanya, A. Suzuki, and K. Vaidyanathan. Reconfiguring spanning and induced subgraphs. In Proceedings of the 24th International Computing and Combinatorics Conference (COCOON 2018), volume 10976 of Lecture Notes in Computer Science, pages 428-440, 2018. Google Scholar
  5. R.A. Hearn and E.D. Demaine. PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theoretical Computer Science, 343(1-2):72-96, 2005. Google Scholar
  6. J. van den Heuvel. The complexity of change. In Surveys in Combinatorics 2013, volume 409 of London Mathematical Society Lecture Note Series, pages 127-160. Cambridge University Press, 2013. Google Scholar
  7. T. Ito, E.D. Demaine, N.J.A. Harvey, C.H. Papadimitriou, M. Sideri, R. Uehara, and Y. Uno. On the complexity of reconfiguration problems. Theoretical Computer Science, 412(12-14):1054-1065, 2011. Google Scholar
  8. M. Kamiński, P. Medvedev, and M. Milanǐc. Shortest paths between shortest paths. Theoretical Computer Science, 412(39):5205-5210, 2011. Google Scholar
  9. N. Korte and R.H. Möhring. An Incremental Linear-time Algorithm for Recognizing Interval Graphs. SIAM Journal on Computing, 18(1):68-81, 1989. Google Scholar
  10. H. Mizuta, T. Ito, and X. Zhou. Reconfiguration of Steiner trees in an unweighted graph. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E100-A(7):1532-1540, 2017. Google Scholar
  11. N. Nishimura. Introduction to reconfiguration. Algorithms, 11(4):52, 2018. Google Scholar
  12. K. Wasa, K. Yamanaka, and H. Arimura. The Complexity of Induced Tree Reconfiguration Problems. IEICE Transactions on Information and Systems, 102-D(3):464-469, 2019. Google Scholar
  13. M. Wrochna. Reconfiguration in bounded bandwidth and tree-depth. Journal of Computer and System Sciences, 93:1-10, 2018. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact