ISSN:
1439-6912
Keywords:
05C80
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
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).
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02125348