An Algorithm for Geometric Minimum Spanning Trees Requiring Nearly Linear Expected Time.
Kenneth L. ClarksonPublished in: Algorithmica (1989)
Keyphrases
- minimum spanning trees
- np hard
- k means
- search space
- face recognition
- minimum spanning tree
- distance metric
- euclidean distance
- segmentation algorithm
- computational complexity
- similarity measure
- pairwise
- special case
- probabilistic model
- data streams
- ant colony optimization
- objective function
- combinatorial optimization
- spanning tree
- feature extraction
- image segmentation