The First Approximated Distributed Algorithm For The Minimum Degree Spanning Tree Problem On General Graphs.
Lélia BlinFranck ButellePublished in: Int. J. Found. Comput. Sci. (2004)
Keyphrases
- learning algorithm
- detection algorithm
- dynamic programming
- spanning tree
- optimal solution
- computational complexity
- special case
- graph isomorphism
- minimum spanning tree
- np hard
- k means
- cost function
- significant improvement
- convergence rate
- convex hull
- tree structure
- neural network
- minimum length
- image segmentation
- bayesian networks
- graph structure
- approximation algorithms
- data clustering
- objective function
- optimization algorithm
- segmentation algorithm
- expectation maximization
- particle swarm optimization
- simulated annealing
- scheduling problem
- computational cost
- search space