Random minimum length spanning trees in regular graphs (Q1288911): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57401554, #quickstatements; #temporary_batch_1705765412645 |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Q703071 / rank | |||
| Property / author | |||
| Property / author: Alan M. Frieze / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:49, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Random minimum length spanning trees in regular graphs |
scientific article |
Statements
Random minimum length spanning trees in regular graphs (English)
0 references
18 May 1999
0 references
For random graphs with edge lengths that are independently and uniformly distributed on the unit interval, the expected minimum length of a spanning forest is investigated. In particular, the expected minimum length of a spanning tree is given asymptotically for regular connected graphs.
0 references
expected minimum length
0 references
random spanning trees
0 references
random graphs
0 references
regular connected graphs
0 references
