Parallel Clustering Based on Partitions of Local Minimal-Spanning-Trees.
Shiau-Rung TsuiWei-Jen WangShi-Shan ChenLee Shu-Teng ChenChilung WangPublished in: PAAP (2012)
Keyphrases
- spanning tree
- depth first search
- edge disjoint
- minimum spanning tree
- minimum cost
- minimum spanning trees
- parallel implementation
- parallel processing
- total length
- weighted graph
- undirected graph
- clustering algorithm
- neural network
- traveling salesman problem
- approximation algorithms
- feature space
- parallel computing
- parallel computation