Fast exact shortest-path distance queries on large networks by pruned landmark labeling.
Takuya AkibaYoichi IwataYuichi YoshidaPublished in: SIGMOD Conference (2013)
Keyphrases
- shortest path
- path length
- shortest distance
- spatial networks
- path queries
- edge weights
- geodesic distance
- flow graph
- path selection
- shortest path problem
- query processing
- shortest path algorithm
- road network
- betweenness centrality
- response time
- query evaluation
- distance transformation
- reverse nearest neighbor
- optimal path
- query language
- travel time
- source node
- distance matrix
- routing algorithm
- network structure
- minimal surface
- weighted graph
- complex networks
- neighborhood sequences
- distance measure
- small world
- social networks
- distance transform
- range queries
- finding the shortest path