On random minimum length spanning trees

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1989 English Publisher:Springer Science and Business Media LLCJournal:Combinatorica, volume 9, pages 363-374 (issn: 0209-9683, eissn: 1439-6912,

Copyright policy )

Authors: Alan M. Frieze; Colin J. H. McDiarmid;

doi: 10.1007/bf02125348

On random minimum length spanning trees

- Summary
- Metrics

Abstract

We extend and strengthen the result that, in the complete graphKn with independent random edge-lengths uniformly distributed on [0, 1], the expected length of the minimum spanning tree tends toζ(3) asn→∞. In particular, ifKn is replaced by the complete bipartite graphKn, n then there is a corresponding limit of 2ζ (3).

Related Organizations

Carnegie Mellon University
United States
University of Oxford
United Kingdom

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	25
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average