|
Related articles:
Euclidean minimum spanning tree
Spanning Tree Protocol
Greedy algorithm
Key terms: spanning tree weight algorithm graph minimum edge minimum spanning tree mst problem paths connected vertices computing cut distributed possible cycle smaller node subtrees graph theory solve function bottleneck unique cable contradiction property subset figure cost less than linear necessarily larger proved given graph equal then there assumption zeta constrained belongs subgraph vertex approaches assume processors complexity linear time more than Search external links cited by footnotes on Wikipedia page Minimum spanning tree: |
|