A note on random minimum length spanning trees
The minimum length spanning tree is considered when edges have independent random lengths that are uniformly distributed on the unit interval. The asymptotic expected minimum length is obtained for regular graphs of increasing order.
scientific article; zbMATH DE number 1498624