Login / Signup
Experimental analysis of dynamic all pairs shortest path algorithms.
Camil Demetrescu
Stefano Emiliozzi
Giuseppe F. Italiano
Published in:
SODA (2004)
Keyphrases
</>
shortest path
shortest path algorithm
minimum cost flow
dynamic environments
road network
edge weights
shortest path problem
data structure
routing algorithm
shortest distance
strongly connected components
reverse nearest neighbor