Reconfiguration of Minimum Steiner Trees via Vertex Exchanges
From MaRDI portal
Publication:5092443
DOI10.4230/LIPIcs.MFCS.2019.79OpenAlexW2971242588MaRDI QIDQ5092443
Tatsuhiko Hatanaka, Xiao Zhou, Takehiro Ito, Haruka Mizuta
Publication date: 21 July 2022
Full work available at URL: https://doi.org/10.4230/lipics.mfcs.2019.79
Related Items
Reconfiguration of spanning trees with degree constraints or diameter constraints, Reconfiguration of Spanning Trees with Many or Few Leaves
Cites Work
- The complexity of rerouting shortest paths
- On the complexity of reconfiguration problems
- Shortest paths between shortest paths
- Reconfiguration in bounded bandwidth and tree-depth
- Introduction to reconfiguration
- Rerouting shortest paths in planar graphs
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- The complexity of change
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- Graph Classes: A Survey
- Reconfiguring spanning and induced subgraphs