On finding most uniform spanning trees (Q1102979): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:46, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On finding most uniform spanning trees |
scientific article |
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
