A randomized linear-time algorithm to find minimum spanning trees (Q4369866): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: David R. Karger / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Philip N. Klein / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Robert Endre Tarjan / rank | |||
Normal rank | |||
Revision as of 21:42, 19 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
