On random minimum length spanning trees (Q923108)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On random minimum length spanning trees |
scientific article; zbMATH DE number 4170955
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On random minimum length spanning trees |
scientific article; zbMATH DE number 4170955 |
Statements
On random minimum length spanning trees (English)
0 references
1989
0 references
Independent identically distributed positive random variables are used as edge lengths in a given graph, and the length of the minimum spanning tree is investigated. In particular, for a complete bipartite graph \(K_{n,n}\) with the edge lengths uniformly distributed on (0,1), the expected length of the minimum spanning tree is shown to converge to 2.404....
0 references
random edge lengths
0 references
minimum spanning tree
0 references
