Improved Bounds for Shortest Paths in Dense Distance Graphs.
Pawel GawrychowskiAdam KarczmarzPublished in: CoRR (2016)
Keyphrases
- shortest path
- finding the shortest path
- shortest distance
- weighted graph
- path length
- geodesic distance
- edge weights
- shortest path algorithm
- shortest path problem
- road network
- graph search
- strongly connected components
- distance transformation
- distance function
- lower bound
- betweenness centrality
- optimal path
- distance measure
- upper bound
- optimal solution
- graph partitioning
- travel time
- graph mining
- euclidean space
- flow graph
- minimum cost flow
- directed graph