The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs.
Lélia BlinFranck ButellePublished in: IPDPS (2003)
Keyphrases
- spanning tree
- detection algorithm
- computational complexity
- learning algorithm
- cost function
- significant improvement
- special case
- dynamic programming
- random graphs
- minimum spanning tree
- worst case
- matching algorithm
- constant factor
- adjacency graph
- graph construction
- square error
- minimum cost
- clustering method
- social networks
- expectation maximization
- k means
- preprocessing
- segmentation algorithm
- linear combination
- graph matching
- weighted graph
- simulated annealing
- undirected graph
- knn
- computational cost
- np hard
- objective function