The Diameter of the Minimum Spanning Tree of a Complete Graph
2006 ◽
Vol DMTCS Proceedings vol. AG,...
(Proceedings)
◽
Keyword(s):
International audience Let $X_1,\ldots,X_{n\choose 2}$ be independent identically distributed weights for the edges of $K_n$. If $X_i \neq X_j$ for$ i \neq j$, then there exists a unique minimum weight spanning tree $T$ of $K_n$ with these edge weights. We show that the expected diameter of $T$ is $Θ (n^{1/3})$. This settles a question of [Frieze97].
Keyword(s):
2015 ◽
Vol 25
(1)
◽
pp. 89-107
◽
Keyword(s):
1983 ◽
Vol 62
(8)
◽
pp. 2581-2602
2000 ◽
Vol 30
(5)
◽
pp. 1427-1442
◽
Keyword(s):
2001 ◽
Vol 28
(8)
◽
pp. 767-785
◽
Keyword(s):
1999 ◽
Vol 09
(04)
◽
pp. 499-509
◽