Faster shortest paths in dense distance graphs, with applications.
Shay MozesYahav NussbaumOren WeimannPublished in: Theor. Comput. Sci. (2018)
Keyphrases
- shortest path
- finding the shortest path
- shortest distance
- weighted graph
- edge weights
- path length
- geodesic distance
- graph search
- shortest path problem
- strongly connected components
- shortest path algorithm
- road network
- betweenness centrality
- graph model
- dynamic programming
- neighborhood sequences
- distance transformation
- distance measure
- small world
- minimum length
- graph theory
- flow graph
- directed graph
- euclidean distance
- optimal path
- travel time
- distance matrix
- minimum cost flow
- np hard