Deterministic decremental single source shortest paths: beyond the o(mn) bound.
Aaron BernsteinShiri ChechikPublished in: STOC (2016)
Keyphrases
- shortest path
- single source
- shortest path problem
- lower bound
- shortest path algorithm
- routing algorithm
- worst case
- flow graph
- optimal path
- geodesic distance
- path length
- weighted graph
- minimum cost flow
- travel time
- minimal surface
- road network
- strongly connected components
- betweenness centrality
- multi source
- state space