An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees (Q1218265)
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: An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees |
scientific article; zbMATH DE number 3481832
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees |
scientific article; zbMATH DE number 3481832 |
Statements
An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees (English)
0 references
1975
0 references
