Revision as of 15:49, 4 September 2006 edit 194.204.64.65 (talk) →References ← Previous edit		Revision as of 15:49, 4 September 2006 edit undo 194.204.64.65 (talk) →References Next edit →
Line 23: [[Category:Graph theory]] 2. B. Awerbuch. Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election, and Related Problems. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC), New York City, New York, May 1987.

Distributed minimum spanning tree: Difference between revisions