Time-space trade-offs for computing Euclidean minimum spanning trees (Q2294682): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Merged Item from Q3387271
 
(5 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees
description / endescription / en
scientific article
scientific article; zbMATH DE number 7293351
Property / title
 
Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees (English)
Property / title: Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1486.68202 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.20382/jocg.v11i1a21 / rank
 
Normal rank
Property / publication date
 
12 January 2021
Timestamp+2021-01-12T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 12 January 2021 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7293351 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962750386 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2778138247 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1712.06431 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:53, 6 May 2024

scientific article; zbMATH DE number 7293351
  • Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees
Language Label Description Also known as
English
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

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
0 references
0 references
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

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references