Many distances in planar graphs (Q5920250): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-010-9459-0
+Normal rank
@@ Property / OpenAlex ID @@
+W3139290474
@@ Property / OpenAlex ID: W3139290474 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar spanners and approximate shortest path queries among obstacles in the plane
+Normal rank
@@ Property / cites work @@
+Many distances in planar graphs
@@ Property / cites work: Many distances in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934586
@@ Property / cites work: Q2934586 / rank @@
+Normal rank
@@ Property / cites work @@
+All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time
+Normal rank
@@ Property / cites work @@
+Shortest path queries in planar graphs
@@ Property / cites work: Shortest path queries in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945509
@@ Property / cites work: Q4945509 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs, negative weight edges, shortest paths, and near linear time
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
+Normal rank
@@ Property / cites work @@
+Planar graph decomposition and all pairs shortest paths
+Normal rank
@@ Property / cites work @@
+Planar separators and parallel polygon triangulation.
+Normal rank
@@ Property / cites work @@
+Q4829019
@@ Property / cites work: Q4829019 / rank @@
+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 @@
+Shortest paths in directed planar graphs with negative lengths
+Normal rank
@@ Property / cites work @@
+Q2921664
@@ Property / cites work: Q2921664 / rank @@
+Normal rank
@@ Property / cites work @@
+Short path queries in planar graphs in constant time
+Normal rank
@@ Property / cites work @@
+Q3601569
@@ Property / cites work: Q3601569 / rank @@
+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 @@
+Generalized Nested Dissection
@@ Property / cites work: Generalized Nested Dissection / rank @@
+Normal rank
@@ Property / cites work @@
+Finding small simple cycle separators for 2-connected planar graphs
+Normal rank
@@ Property / cites work @@
+Approximating the Stretch Factor of Euclidean Graphs
+Normal rank
@@ Property / cites work @@
+The design of dynamic data structures
@@ Property / cites work: The design of dynamic data structures / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
+Normal rank
@@ Property / cites work @@
+Compact oracles for reachability and approximate distances in planar digraphs
+Normal rank
@@ Property / cites work @@
+Q4796165
@@ Property / cites work: Q4796165 / rank @@
+Normal rank