A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree.
Beat GfellerNicola SantoroPeter WidmayerPublished in: DISC (2007)
Keyphrases
- spanning tree
- edge disjoint
- minimum spanning tree
- minimum cost
- undirected graph
- detection algorithm
- search space
- optimal solution
- minimum total cost
- minimum weight
- cost function
- k means
- computational complexity
- weighted graph
- edge weights
- learning algorithm
- distributed systems
- tree structure
- minimum spanning trees
- worst case
- dynamic programming
- preprocessing
- square error