An algorithm for geometric minimum spanning trees requiring nearly linear expected time (Q1824386)
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: An algorithm for geometric minimum spanning trees requiring nearly linear expected time |
scientific article; zbMATH DE number 4117845
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for geometric minimum spanning trees requiring nearly linear expected time |
scientific article; zbMATH DE number 4117845 |
Statements
An algorithm for geometric minimum spanning trees requiring nearly linear expected time (English)
0 references
1989
0 references
linear expected time complexity
0 references
minimum spanning tree
0 references
