Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time (Q359743): Difference between revisions

@@ Property / cites work @@
+A Separator Theorem for Nonplanar Graphs
@@ Property / cites work: A Separator Theorem for Nonplanar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for graphs of bounded treewidth via orthogonal range searching
+Normal rank
@@ Property / cites work @@
+Q3470486
@@ Property / cites work: Q3470486 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
+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 @@
+Computing the dilation of edge-augmented graphs in metric spaces
+Normal rank