Login / Signup
The complexity of rerouting shortest paths.
Paul S. Bonsma
Published in:
Theor. Comput. Sci. (2013)
Keyphrases
</>
shortest path
shortest path algorithm
shortest path problem
road network
routing algorithm
optimal path
flow graph
computational complexity
path length
weighted graph
travel time
minimum cost flow
finding the shortest path
geodesic distance
high dimensional
edge weights