On the worst case of a minimal spanning tree algorithm for euclidean space (Q1836479): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding minimal spanning trees in a Euclidean coordinate space / rank | |||
Normal rank | |||
Latest revision as of 18:05, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the worst case of a minimal spanning tree algorithm for euclidean space |
scientific article |
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
