An algorithm for geometric minimum spanning trees requiring nearly linear expected time (Q1824386)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm for geometric minimum spanning trees requiring nearly linear expected time |
scientific article |
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