Revision as of 18:27, 25 March 2009 edit 128.173.98.90 (talk) →Approximation Algorithms ← Previous edit		Revision as of 19:36, 25 March 2009 edit undo 80.168.225.133 (talk) fmt Next edit →
Line 9: <ref>David Peleg and Vitaly Rubinovich “A near tight lower bound on the time complexity of Distributed Minimum Spanning Tree Construction”, SIAM Journal of Computing, 2000, and IEEE Foundations of Computer Science (FOCS) Symposium, 1999.</ref> <math>\Omega\left({\frac{\sqrt V}{\log V}}\right).</math> == Approximation Algorithms ==

Distributed minimum spanning tree: Difference between revisions