A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree.
Lélia BlinFranck ButellePublished in: OPODIS (2001)
Keyphrases
- spanning tree
- minimum weight
- minimum spanning tree
- weighted graph
- maximum cardinality
- bipartite graph
- undirected graph
- dynamic programming
- minimum spanning trees
- worst case
- computational complexity
- special case
- minimum cost
- edge weights
- greedy heuristic
- relational databases
- particle swarm optimization
- learning algorithm
- np hard
- planar graphs
- graph structure
- average case
- shortest path
- simulated annealing