Login / Signup
The Complexity of Rerouting Shortest Paths.
Paul S. Bonsma
Published in:
MFCS (2012)
Keyphrases
</>
shortest path
shortest path problem
shortest path algorithm
computational complexity
road network
flow graph
travel time
routing algorithm
path length
minimum cost flow
weighted graph
finding the shortest path
geodesic distance
minimal surface
optimal path
shortest distance
strongly connected components