Shortest paths on dynamic graphs.
Giacomo NanniciniLeo LibertiPublished in: Int. Trans. Oper. Res. (2008)
Keyphrases
- shortest path
- finding the shortest path
- weighted graph
- shortest path algorithm
- shortest path problem
- road network
- graph search
- strongly connected components
- dynamic environments
- flow graph
- travel time
- geodesic distance
- graph partitioning
- path length
- spatial networks
- betweenness centrality
- graph theory
- edge weights
- dynamic programming
- shortest distance