Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: Shortest path
Choose Problem

Authors: all
Choose Author


[12]
Marcin Kamiński, Paul Medvedev and Martin Milanič,
Shortest paths between shortest paths,
Theoretical Computer Science 412(39), pp. 5205-5210, 2011. (LINK)

[19]
Paul S. Bonsma,
The complexity of rerouting shortest paths,
Theoretical Computer Science 510, pp. 1-12, 2013. (LINK)

[31]
Marcin Wrochna,
Reconfiguration in bounded bandwidth and treedepth,
arXiv 1405.0847, 2014. (LINK)

[56]
Paul S. Bonsma,
Rerouting shortest paths in planar graphs,
Discrete Applied Mathematics 231, pp. 95-112, 2017. (LINK)