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

@@ Property / cites work @@
+On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs
+Normal rank
@@ Property / cites work @@
+Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
+Normal rank
@@ Property / cites work @@
+Improved Distance Oracles and Spanners for Vertex-Labeled Graphs
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+Constant Query Time $$(1+\epsilon )$$ -Approximate Distance Oracle for Planar Graphs
+Normal rank
@@ Property / cites work @@
+Faster shortest-path algorithms for planar graphs
@@ Property / cites work: Faster shortest-path algorithms for planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Distance Oracles for Vertex-Labeled Graphs
@@ Property / cites work: Distance Oracles for Vertex-Labeled Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs
+Normal rank
@@ Property / cites work @@
+More Compact Oracles for Approximate Distances in Undirected Planar Graphs
+Normal rank
@@ Property / cites work @@
+Q4829018
@@ Property / cites work: Q4829018 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921664
@@ Property / cites work: Q2921664 / rank @@
+Normal rank
@@ Property / cites work @@
+(1 + ε)-Distance Oracles for Vertex-Labeled Planar Graphs
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Power of Dynamic Distance Oracles
@@ Property / cites work: The Power of Dynamic Distance Oracles / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient vertex-label distance oracles for planar graphs
+Normal rank
@@ Property / cites work @@
+Q4796171
@@ Property / cites work: Q4796171 / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest-path queries in static networks
@@ Property / cites work: Shortest-path queries in static networks / rank @@
+Normal rank
@@ Property / cites work @@
+Compact oracles for reachability and approximate distances in planar digraphs
+Normal rank
@@ Property / cites work @@
+Approximate distance oracles
@@ Property / cites work: Approximate distance oracles / rank @@
+Normal rank
@@ Property / cites work @@
+Amortized Bounds for Dynamic Orthogonal Range Reporting
+Normal rank
@@ Property / cites work @@
+Log-logarithmic worst-case range queries are possible in space theta(N)
+Normal rank
@@ Property / cites work @@
+Q5743389
@@ Property / cites work: Q5743389 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff
+Normal rank