Login / Signup
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study.
Camil Demetrescu
Daniele Frigioni
Alberto Marchetti-Spaccamela
Umberto Nanni
Published in:
WAE (2000)
Keyphrases
</>
shortest path
edge weights
road network
shortest path algorithm
shortest path problem
minimum length
routing algorithm
weighted graph
shortest distance
travel time
geodesic distance
optimal path
path length
minimum cost flow
strongly connected components
minimal surface
finding the shortest path
image sequences