Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs.
Aaron BernsteinShiri ChechikPublished in: SODA (2017)
Keyphrases
- shortest path
- shortest path problem
- single source
- finding the shortest path
- weighted graph
- shortest path algorithm
- road network
- directed graph
- routing algorithm
- betweenness centrality
- path length
- geodesic distance
- strongly connected components
- multi source
- graph partitioning
- graphical models
- edge weights
- optimal path
- database
- travel time
- minimum cost flow
- high dimensional
- search algorithm
- data sets