Login / Signup
A fast distributed approximation algorithm for minimum spanning trees.
Maleq Khan
Gopal Pandurangan
Published in:
Distributed Comput. (2008)
Keyphrases
</>
particle swarm optimization
computational complexity
k means
learning algorithm
objective function
np hard
face recognition
search space
worst case
distance transform
neural network
optimal solution
simulated annealing
social network analysis
graph structure
minimum spanning trees