On the worst case of a minimal spanning tree algorithm for euclidean space (Q1836479)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3797181
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the worst case of a minimal spanning tree algorithm for euclidean space |
scientific article; zbMATH DE number 3797181 |
Statements
On the worst case of a minimal spanning tree algorithm for euclidean space (English)
0 references
1983
0 references
23, 2-8 (1983)
0 references
worst case running time
0 references
minimal spanning tree
0 references
