Approximate Shortest Path Queries in Graphs Using Voronoi Duals.
Shinichi HonidenMichael E. HouleChristian SommerMartin WolffPublished in: ISVD (2009)
Keyphrases
- shortest path
- finding the shortest path
- path queries
- weighted graph
- spatial networks
- flow graph
- shortest path algorithm
- shortest path problem
- minimum spanning tree
- query processing
- road network
- reverse nearest neighbor
- betweenness centrality
- query evaluation
- edge weights
- strongly connected components
- routing algorithm
- path length
- graph search
- pre computed
- query language
- optimal path
- travel time
- complex queries
- response time
- graph theory
- range queries
- data model
- voronoi diagram
- path selection
- minimal surface
- nearest neighbor
- directed graph
- graph structure
- spanning tree
- graph partitioning