An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees
Francis Y. L. ChinH. F. TingPublished in: FOCS (1985)
Keyphrases
- spanning tree
- minimum weight
- minimum spanning tree
- worst case
- greedy heuristic
- np hard
- computational complexity
- times faster
- objective function
- bipartite graph
- learning algorithm
- optimal solution
- segmentation method
- particle swarm optimization
- knapsack problem
- simulated annealing
- distance transform
- weighted graph
- search space
- lower bound