Time-space trade-offs for computing Euclidean minimum spanning trees (Q2294682)
From MaRDI portal
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Time-space trade-offs for computing Euclidean minimum spanning trees |
No description defined |
Statements
Time-space trade-offs for computing Euclidean minimum spanning trees (English)
0 references
12 February 2020
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
