A minimum spanning tree algorithm with Inverse-Ackermann type complexity.

Bernard Chazelle

Published in: J. ACM (2000)

Keyphrases

minimum spanning tree
worst case
computational complexity
cost function
search space
np hard
special case
spanning tree
similarity measure
upper bound
neural network
simulated annealing
particle swarm optimization
segmentation algorithm
traveling salesman problem
graph theory
graph structure