Random Minimum Length Spanning Trees in Regular Graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1998 English Publisher:Springer Science and Business Media LLCJournal:COMBINATORICA, volume 18, pages 311-333 (issn: 0209-9683,

Copyright policy )Funded by:NSF | Probabilistic Considerati...

Authors: Andrew Beveridge; Alan M. Frieze; Colin McDiarmid;

doi: 10.1007/pl00009825

Random Minimum Length Spanning Trees in Regular Graphs

- Summary
- Subjects
- Metrics

Abstract

For random graphs with edge lengths that are independently and uniformly distributed on the unit interval, the expected minimum length of a spanning forest is investigated. In particular, the expected minimum length of a spanning tree is given asymptotically for regular connected graphs.

Related Organizations

Carnegie Mellon University
United States
University of Oxford
United Kingdom

Keywords

expected minimum length, random spanning trees, Combinatorial probability, regular connected graphs, Random graphs (graph-theoretic aspects), random graphs

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).	30
	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