Reconfiguration of Minimum Steiner Trees via Vertex Exchanges
From MaRDI portal
Recommendations
Cites work
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- Graph Classes: A Survey
- Introduction to reconfiguration
- On the complexity of reconfiguration problems
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Reconfiguration in bounded bandwidth and tree-depth
- Rerouting shortest paths in planar graphs
- Shortest paths between shortest paths
- The complexity of change
- The complexity of rerouting shortest paths
Cited in
(3)
This page was built for publication: Reconfiguration of Minimum Steiner Trees via Vertex Exchanges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092443)