Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs.
Dorothea WagnerThomas WillhalmPublished in: ESA (2003)
Keyphrases
- shortest path
- finding the shortest path
- weighted graph
- minimal surface
- shortest path algorithm
- shortest path problem
- strongly connected components
- graph search
- edge weights
- road network
- shortest distance
- betweenness centrality
- minimum cost flow
- travel time
- optimal path
- high dimensional
- graph partitioning
- sparse representation
- dynamic programming
- small world
- flow graph
- geometric structure
- np complete
- graph cuts