A randomized linear-time algorithm for finding minimum spanning trees (extended abstract) (Q2817593)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A randomized linear-time algorithm for finding minimum spanning trees (extended abstract) |
scientific article; zbMATH DE number 6621771
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A randomized linear-time algorithm for finding minimum spanning trees (extended abstract) |
scientific article; zbMATH DE number 6621771 |
Statements
1 September 2016
0 references
0.9851395
0 references
0.9300345
0 references
0.92924076
0 references
0.9286015
0 references
0.9261392
0 references
0.92244864
0 references
0.9217141
0 references
0.92013776
0 references
A randomized linear-time algorithm for finding minimum spanning trees (extended abstract) (English)
0 references
