Fully dynamic shortest paths in digraphs with arbitrary arc weights.

Daniele Frigioni Alberto Marchetti-Spaccamela Umberto Nanni

Published in: J. Algorithms (2003)

Keyphrases

shortest path
shortest path problem
shortest path algorithm
road network
minimum length
weighted graph
edge weights
path length
dynamic environments
routing algorithm
travel time
minimum cost flow
strongly connected components
similarity measure
optimal path