Querying Shortest Path Distance with Bounded Errors in Large Graphs.
Miao QiaoHong ChengJeffrey Xu YuPublished in: SSDBM (2011)
Keyphrases
- shortest path
- shortest distance
- finding the shortest path
- weighted graph
- edge weights
- path length
- geodesic distance
- graph databases
- shortest path problem
- graph search
- shortest path algorithm
- road network
- strongly connected components
- routing algorithm
- minimum spanning tree
- distance measure
- betweenness centrality
- distance transformation
- travel time
- path selection
- query language
- query processing
- small world
- optimal path
- minimal surface
- path queries
- graph model
- graph mining
- flow graph
- neighborhood sequences
- euclidean distance
- triangle inequality
- distance matrix
- spanning tree
- graph structure
- distance function