Web Survey on Combinatorial Reconfiguration

(back to home) (about this survey)

Filters:
Problems: Shortest path
Choose Problem

Authors: Paul S. Bonsma
Choose Author


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

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