A randomized linear-time algorithm to find minimum spanning trees (Q4369866): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q55871136, #quickstatements; #temporary_batch_1708296850199 |
Removed claims |
||
Property / author | |||
Property / author: David R. Karger / rank | |||
Property / author | |||
Property / author: Philip N. Klein / rank | |||
Property / author | |||
Property / author: Robert Endre Tarjan / 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