Random minimum length spanning trees in regular graphs (Q1288911): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q57401554, #quickstatements; #temporary_batch_1705765412645 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57401554 / rank | |||
Normal rank | |||
Revision as of 17:50, 20 January 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
