An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees (Q1218265)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees |
scientific article |
Statements
An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees (English)
0 references
1975
0 references
