A randomized linear-time algorithm to find minimum spanning trees (Q4369866): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1145/201019.201022 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2138304862 / rank | |||
Normal rank |
Latest revision as of 22:03, 19 March 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