A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree.
Beat GfellerNicola SantoroPeter WidmayerPublished in: IEEE Trans. Dependable Secur. Comput. (2011)
Keyphrases
- spanning tree
- edge disjoint
- minimum spanning tree
- undirected graph
- minimum weight
- minimum cost
- dynamic programming
- np hard
- objective function
- knapsack problem
- search space
- maximum distance
- distributed systems
- detection algorithm
- combinatorial optimization
- expectation maximization
- square error
- weighted graph
- bipartite graph
- learning algorithm
- particle swarm optimization
- upper bound
- cost function
- special case
- preprocessing
- computational complexity
- search engine