Article contents
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
Published online by Cambridge University Press: 09 October 2017
Abstract
Assume that the edges of the complete graph Kn are given independent uniform [0, 1] weights. We consider the expected minimum total weight μk of k ⩽ 2 edge-disjoint spanning trees. When k is large we show that μk ≈ k2. Most of the paper is concerned with the case k = 2. We show that m2 tends to an explicitly defined constant and that μ2 ≈ 4.1704288. . . .
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2017
References
- 3
- Cited by