Improved Bounds for Shortest Paths in Dense Distance Graphs.
Pawel GawrychowskiAdam KarczmarzPublished in: ICALP (2018)
Keyphrases
- shortest path
- finding the shortest path
- shortest distance
- weighted graph
- path length
- edge weights
- geodesic distance
- shortest path algorithm
- shortest path problem
- graph search
- road network
- strongly connected components
- betweenness centrality
- distance transformation
- upper bound
- lower bound
- neighborhood sequences
- minimum cost flow
- travel time
- distance measure
- dynamic programming
- optimal path
- graph theory
- directed graph
- image sequences
- flow graph
- markov chain