Efficient dynamic approximate distance oracles for vertex-labeled planar graphs (Q5915659): Difference between revisions

← Older edit Newer edit →

@@ description / en / description / en @@
+scientific article; zbMATH DE number 7146024
@@ Property / zbMATH Open document ID @@
+.68248
@@ Property / zbMATH Open document ID: 1436.68248 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/s00224-019-09949-5
@@ Property / DOI: 10.1007/s00224-019-09949-5 / rank @@
+Normal rank
@@ Property / published in @@
+Theory of Computing Systems
@@ Property / published in: Theory of Computing Systems / rank @@
+Normal rank
@@ Property / publication date @@
+December 2019Timestamp +2019-12-19T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2019-12-19T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 19 December 2019 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+7146024
@@ Property / zbMATH DE Number: 7146024 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+\(\epsilon\)-cover
@@ Property / zbMATH Keywords: \(\epsilon\)-cover / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963500039
@@ Property / OpenAlex ID: W2963500039 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Graphs
@@ Property / describes a project that uses: Graphs / rank @@
+Normal rank