A randomized linear-time algorithm to find minimum spanning trees (Q4369866): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:47, 7 February 2024
scientific article; zbMATH DE number 1103531
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A randomized linear-time algorithm to find minimum spanning trees |
scientific article; zbMATH DE number 1103531 |
Statements
A randomized linear-time algorithm to find minimum spanning trees (English)
0 references
2 February 1998
0 references
a randomized linear-time algorithm
0 references
minimum spanning tree
0 references
