Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths.
S. BanerjeeR. K. GhoshA. P. K. ReddyPublished in: J. Parallel Distributed Comput. (1996)
Keyphrases
- disjoint paths
- parallel algorithm
- approximation algorithms
- directed graph
- undirected graph
- parallel computation
- shared memory
- parallel programming
- binary search trees
- parallel implementations
- cluster of workstations
- special case
- shortest path
- parallel version
- medial axis transform
- dominant points
- discovery of association rules