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

@@ aliases / en / 0 / aliases / en / 0 @@
+Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees
@@ description / en / description / en @@
+scientific article; zbMATH DE number 7293351
@@ Property / title @@
+Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68202
@@ Property / zbMATH Open document ID: 1486.68202 / rank @@
+Normal rank
@@ Property / DOI @@
+.20382/jocg.v11i1a21
@@ Property / DOI: 10.20382/jocg.v11i1a21 / rank @@
+Normal rank
@@ Property / publication date @@
+January 2021Timestamp +2021-01-12T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2021-01-12T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 12 January 2021 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+7293351
@@ Property / zbMATH DE Number: 7293351 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2778138247
@@ Property / OpenAlex ID: W2778138247 / rank @@
+Normal rank

Latest revision as of 08:53, 6 May 2024

scientific article; zbMATH DE number 7293351

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