Fast and accurate estimation of shortest paths in large graphs.
Andrey GubichevSrikanta J. BedathurStephan SeufertGerhard WeikumPublished in: CIKM (2010)
Keyphrases
- accurate estimation
- shortest path
- finding the shortest path
- weighted graph
- shortest path problem
- shortest path algorithm
- edge weights
- dynamic programming
- strongly connected components
- betweenness centrality
- graph search
- road network
- travel time
- minimal surface
- graph partitioning
- geodesic distance
- path length
- optimal path
- directed graph
- graph model
- shortest distance
- flow graph
- minimum cost flow
- graph mining
- bipartite graph