Transition Refinement for Deriving a Distributed Minimum Weight Spanning Tree Algorithm.
Sibylle PeukerPublished in: ICATPN (2002)
Keyphrases
- minimum weight
- spanning tree
- minimum spanning tree
- weighted graph
- computational complexity
- dynamic programming
- greedy heuristic
- undirected graph
- minimum cost
- maximum cardinality
- optimal solution
- randomized algorithm
- objective function
- bipartite graph
- particle swarm optimization
- worst case
- high dimensional
- genetic algorithm