An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem.
Tadao TakaokaPublished in: WG (1988)
Keyphrases
- orders of magnitude
- parallel algorithm
- shortest path problem
- shortest path
- single source
- interval data
- parallel computation
- combinatorial optimization problems
- parallel programming
- shared memory
- parallel implementations
- directed acyclic graph
- directed graph
- multiple objectives
- cluster of workstations
- dominant points
- binary search trees
- parallel version
- metaheuristic
- medial axis transform
- computationally efficient
- search space