Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique.
Li-Jen MaoSheau-Dong LangPublished in: ICPP Workshops (2002)
Keyphrases
- parallel algorithm
- nearest neighbor
- data structure
- knn
- parallel computation
- spanning tree
- data points
- nearest neighbor search
- parallel programming
- high dimensional
- index structure
- training set
- real time
- parallel implementations
- tree structure
- cluster of workstations
- parallel version
- shared memory
- combinatorial search problems
- parallel computers
- discovery of association rules
- constraint satisfaction
- pc cluster
- association rules
- neural network