Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time (Q5348455): Difference between revisions

@@ Property / author @@
-Philip N. Klein
@@ Property / author: Philip N. Klein / rank @@
-Normal rank
@@ Property / author @@
+Philip N. Klein
@@ Property / author: Philip N. Klein / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+MAXFLOW
@@ Property / describes a project that uses: MAXFLOW / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of very large-scale neighborhood search techniques
+Normal rank
@@ Property / cites work @@
+All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs
+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 @@
+Q4787357
@@ Property / cites work: Q4787357 / 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 @@
+Flows in One-Crossing-Minor-Free Graphs
@@ Property / cites work: Flows in One-Crossing-Minor-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Accelerated Bend Minimization
@@ Property / cites work: Accelerated Bend Minimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4947407
@@ Property / cites work: Q4947407 / rank @@
+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 @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Submatrix Maximum Queries in Monge Matrices
+Normal rank
@@ Property / cites work @@
+Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search
+Normal rank
@@ Property / cites work @@
+Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
+Normal rank
@@ Property / cites work @@
+Beyond the flow decomposition barrier
@@ Property / cites work: Beyond the flow decomposition barrier / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to the maximum-flow problem
@@ Property / cites work: A new approach to the maximum-flow problem / 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 @@
+An efficient algorithm for image segmentation, Markov random fields and related problems
+Normal rank
@@ Property / cites work @@
+The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
+Normal rank
@@ Property / cites work @@
+Q2934672
@@ Property / cites work: Q2934672 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved algorithms for min cut and max flow in undirected planar graphs
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Shortest Paths in Sparse Networks
+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 @@
+Flow in planar graphs with vertex capacities
@@ Property / cites work: Flow in planar graphs with vertex capacities / 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 @@
+Shortest paths in directed planar graphs with negative lengths
+Normal rank
@@ Property / cites work @@
+A fully dynamic approximation scheme for shortest paths in planar graphs
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for classification problems with pairwise relationships
+Normal rank
@@ Property / cites work @@
+Finding small simple cycle separators for 2-connected planar graphs
+Normal rank
@@ Property / cites work @@
+Flow in Planar Graphs with Multiple Sources and Sinks
+Normal rank
@@ Property / cites work @@
+Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time
+Normal rank
@@ Property / cites work @@
+Max flows in O(nm) time, or better
@@ Property / cites work: Max flows in O(nm) time, or better / 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 / full work available at URL @@
+https://doi.org/10.1137/15m1042929
+Normal rank
@@ Property / OpenAlex ID @@
+W2741786970
@@ Property / OpenAlex ID: W2741786970 / rank @@
+Normal rank