Abstract
We extend and strengthen the result that, in the complete graphK n with independent random edge-lengths uniformly distributed on [0, 1], the expected length of the minimum spanning tree tends toζ(3) asn→∞. In particular, ifK n is replaced by the complete bipartite graphK n, n then there is a corresponding limit of 2ζ (3).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B.Bollobás and I.Simon, On the expected behaviour of disjoint set union algorithms,Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, (1985) 224–231.
W.Feller,An Introduction to Probability Theory, Volume 1, John Wiley and Sons (1966).
A. M. Frieze, On the value of a random minimum spanning tree problem,Discrete Applied Mathematics,10 (1985) 47–56.
C. J. H. McDiarmid, On the greedy algorithm with random costs,Mathematical Programming,36 (1986) 245–255.
M. J. Steele, On Frieze'sζ(3) limit for lengths of minimal spanning trees,Discrete Applied Mahtmeatics,18 (1987) 99–103.
W. F.Stout,Almost Sure Convergence, Academic Press,1974.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Frieze, A.M., McDiarmid, C.J.H. On random minimum length spanning trees. Combinatorica 9, 363–374 (1989). https://doi.org/10.1007/BF02125348
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02125348