An Optimal Parallel Algorithm for Computing Furthest Neighbors in a Tree.
Subir Kumar GhoshAnil MaheshwariPublished in: Inf. Process. Lett. (1992)
Keyphrases
- parallel algorithm
- binary search trees
- parallel computation
- shared memory
- data structure
- parallel implementations
- cluster of workstations
- parallel programming
- b tree
- orders of magnitude
- parallel computers
- nearest neighbor
- processor array
- optimal solution
- web server
- heuristic search
- distributed systems
- dynamic programming