On the value of a random minimum spanning tree problem (Q1066149): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/dam/Frieze85, #quickstatements; #temporary_batch_1731543907597 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/dam/Frieze85 / rank | |||
Normal rank | |||
Latest revision as of 01:32, 14 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the value of a random minimum spanning tree problem |
scientific article |
Statements
On the value of a random minimum spanning tree problem (English)
0 references
1985
0 references
The lengths of the edges in a complete graph of order n are independent identically distributed random variables. Under mild conditions the length of the minimum spanning tree is shown to converge in probability as \(n\to \infty\), and the limiting value of the expected length is determined.
0 references
edge length
0 references
complete graph
0 references
minimum spanning tree
0 references
