Parallel Algorithms for Approximate Undirected Shortest Paths in $m\log^{3+α}n$ Work.
Gary L. MillerRichard PengShen Chen XuPublished in: CoRR (2013)
Keyphrases
- parallel algorithm
- shortest path
- weighted graph
- shortest path algorithm
- path length
- road network
- routing algorithm
- shortest path problem
- parallel computation
- shared memory
- parallel programming
- optimal path
- parallel version
- combinatorial search problems
- cluster of workstations
- flow graph
- geodesic distance
- minimal surface
- travel time
- approximation algorithms
- directed graph
- minimum cost flow
- finding the shortest path
- lower bound
- pc cluster
- parallel implementations
- graphical models