Time-space trade-offs for computing Euclidean minimum spanning trees (Q2294682)
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: Time-space trade-offs for computing Euclidean minimum spanning trees |
scientific article; zbMATH DE number 7293351
- Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time-space trade-offs for computing Euclidean minimum spanning trees |
scientific article; zbMATH DE number 7293351 |
|
Statements
Time-space trade-offs for computing Euclidean minimum spanning trees (English)
0 references
Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees (English)
0 references
12 February 2020
0 references
12 January 2021
0 references
Euclidean minimum spanning tree
0 references
relative neighborhood graph
0 references
time-space trade-off
0 references
limited workspace model
0 references
Kruskal's algorithm
0 references
1.0000001
0 references
0.93327063
0 references
0.92196894
0 references
0.9132298
0 references
0.9127912
0 references
0.9127912
0 references
0.9125093
0 references
0.9111679
0 references
