On finding most uniform spanning trees (Q1102979): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Most and least uniform spanning trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A data structure for dynamic trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4010349 / rank | |||
Normal rank | |||
Latest revision as of 17:19, 18 June 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
