Minimum spanning tree - related articles and key terms

Related articles: Greedy algorithm   Ackermann function   Spanning tree protocol

Key terms: tree   spanning   weight   graph   edge   mst   algorithm   problem   node   cycle   cut   minimum spanning tree   paths   connected   linear   cable   vertices   belong   computing   zeta   subtrees   possible   subset   random   unique   solved   function   distributed   proved   expected   less than   smaller   produce   assumption   subgraph   contrary   graph theory   running time   approaches   processors   complexity   those paths   edge weights   deterministic   contradiction   greedy algorithm   reductio ad absurdum   minimum spanning tree problem   minimum spanning tree algorithm   distributed minimum spanning tree


Search external links cited by footnotes on Wikipedia page Minimum spanning tree: