A Uniform Self-Stabilizing Minimum Diameter Spanning Tree Algorithm.
Franck ButelleChristian LavaultMarc BuiPublished in: CoRR (2013)
Keyphrases
- spanning tree
- minimum spanning tree
- computational complexity
- cost function
- learning algorithm
- preprocessing
- k means
- dynamic programming
- computational cost
- detection algorithm
- search space
- expectation maximization
- segmentation algorithm
- knapsack problem
- square error
- total cost
- undirected graph
- minimum spanning trees
- minimum total cost
- minimum cost
- weighted graph
- similarity measure