A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains.
Li-Jen MaoNarsingh DeoSheau-Dong LangPublished in: ISPAN (1999)
Keyphrases
- parallel algorithm
- nearest neighbor
- knn
- parallel computation
- nearest neighbor search
- training set
- spanning tree
- index structure
- shared memory
- parallel implementations
- parallel programming
- high dimensional
- parallel version
- binary search trees
- data points
- general purpose
- discovery of association rules
- cluster of workstations
- dominant points