Faster approximate diameter and distance oracles in planar graphs (Q1999961): Difference between revisions

@@ Property / cites work @@
+Maintaining information in fully dynamic trees with top trees
+Normal rank
@@ Property / cites work @@
+Faster Approximation of Distances in Graphs
@@ Property / cites work: Faster Approximation of Distances in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved sparse covers for graphs excluding a fixed minor
+Normal rank
@@ Property / cites work @@
+Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
+Normal rank
@@ Property / cites work @@
+All-pairs shortest paths for unweighted undirected graphs in             <i>o</i>             (             <i>mn</i>             ) time
+Normal rank
@@ Property / cites work @@
+Faster Approximate Diameter and Distance Oracles in Planar Graphs
+Normal rank
@@ Property / cites work @@
+Applications of random sampling in computational geometry. II
+Normal rank
@@ Property / cites work @@
+How to draw a planar graph on a grid
@@ Property / cites work: How to draw a planar graph on a grid / rank @@
+Normal rank
@@ Property / cites work @@
+Making data structures persistent
@@ Property / cites work: Making data structures persistent / rank @@
+Normal rank
@@ Property / cites work @@
+Subgraph Isomorphism in Planar Graphs and Related Problems
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
+Normal rank
@@ Property / cites work @@
+Surpassing the information theoretic bound with fusion trees
+Normal rank
@@ Property / cites work @@
+Q4607914
@@ Property / cites work: Q4607914 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4607915
@@ Property / cites work: Q4607915 / rank @@
+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 @@
+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 @@
+Concrete and abstract Voronoi diagrams
@@ Property / cites work: Concrete and abstract Voronoi diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized incremental construction of abstract Voronoi diagrams
+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 @@
+Q3134498
@@ Property / cites work: Q3134498 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138887
@@ Property / cites work: Q3138887 / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank
@@ Property / cites work @@
+Compact oracles for reachability and approximate distances in planar digraphs
+Normal rank
@@ Property / cites work @@
+Approximating the Diameter of Planar Graphs in Near Linear Time
+Normal rank
@@ Property / cites work @@
+Computing the dilation of edge-augmented graphs in metric spaces
+Normal rank
@@ Property / cites work @@
+Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff
+Normal rank