On finding most uniform spanning trees (Q1102979)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On finding most uniform spanning trees |
scientific article; zbMATH DE number 4051657
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finding most uniform spanning trees |
scientific article; zbMATH DE number 4051657 |
Statements
On finding most uniform spanning trees (English)
0 references
1988
0 references
The most uniform spanning tree of a graph with real valued weights assigned to its edges is a spanning tree with the minimal difference between the most and least weighted edges. The paper describes an O(m log n) algorithm for finding such spanning trees (m and n denote the number of edges and vertices respectively.
0 references
weighted graph
0 references
algorithm
0 references
spanning tree
0 references
0 references
0.92049927
0 references
0.9035252
0 references
0.89972365
0 references
0 references
0.89200073
0 references
