Faster shortest paths in dense distance graphs, with applications (Q1698725): Difference between revisions

@@ Property / cites work @@
+Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs
+Normal rank
@@ Property / cites work @@
+Maximum st-Flow in Directed Planar Graphs via Shortest Paths
+Normal rank
@@ Property / cites work @@
+An             <i>O</i>             (             <i>n</i>             log             <i>n</i>             ) algorithm for maximum             <i>st</i>             -flow in a directed planar graph
+Normal rank
@@ Property / cites work @@
+Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
+Normal rank
@@ Property / cites work @@
+Min             <i>st</i>             -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
+Normal rank
@@ Property / cites work @@
+Many distances in planar graphs
@@ Property / cites work: Many distances in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Multiple-Source Shortest Paths in Embedded Graphs
@@ Property / cites work: Multiple-Source Shortest Paths in Embedded Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501344
@@ Property / cites work: Q5501344 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Girth of a Planar Graph in Linear Time
+Normal rank
@@ Property / cites work @@
+Fractional cascading. I: A data structuring technique
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs
+Normal rank
@@ Property / cites work @@
+Q5417668
@@ Property / cites work: Q5417668 / 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 @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Improved Submatrix Maximum Queries in Monge Matrices
+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 @@
+Maximum Flow in Planar Networks
@@ Property / cites work: Maximum Flow in Planar Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Improved algorithms for min cut and max flow in undirected planar graphs
+Normal rank
@@ Property / cites work @@
+Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications
+Normal rank
@@ Property / cites work @@
+Maximum flow in directed planar graphs with vertex capacities
+Normal rank
@@ Property / cites work @@
+Q3113677
@@ Property / cites work: Q3113677 / rank @@
+Normal rank
@@ Property / cites work @@
+The Lattice Structure of Flow in Planar Graphs
@@ Property / cites work: The Lattice Structure of Flow in Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921664
@@ Property / cites work: Q2921664 / rank @@
+Normal rank
@@ Property / cites work @@
+Structured recursive separator decompositions for planar graphs in linear time
+Normal rank
@@ Property / cites work @@
+Shortest paths in directed planar graphs with negative lengths
+Normal rank
@@ Property / cites work @@
+Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
+Normal rank
@@ Property / cites work @@
+The minimum spanning tree problem on a planar graph
+Normal rank
@@ Property / cites work @@
+Q4607913
@@ Property / cites work: Q4607913 / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time
+Normal rank
@@ Property / cites work @@
+Improved Distance Queries in Planar Graphs
@@ Property / cites work: Improved Distance Queries in Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum<i>s</i>-<i>t</i>Cut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time
+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 @@
+Log-logarithmic worst-case range queries are possible in space theta(N)
+Normal rank