Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs.
Konstantin TretyakovAbel Armas-CervantesLuciano García-BañuelosJaak ViloMarlon DumasPublished in: CIKM (2011)
Keyphrases
- shortest path
- shortest distance
- finding the shortest path
- weighted graph
- geodesic distance
- shortest path problem
- road network
- minimum spanning tree
- path length
- edge weights
- shortest path algorithm
- travel time
- graph search
- strongly connected components
- routing algorithm
- path selection
- optimal path
- betweenness centrality
- neighborhood sequences
- distance measure
- graph partitioning
- directed graph
- euclidean distance
- dijkstra algorithm