Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time

@article{Borradaile2011MultipleSourceMM,
  title={Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time},
  author={G. Borradaile and P. Klein and S. Mozes and Yahav Nussbaum and Christian Wulff-Nilsen},
  journal={2011 IEEE 52nd Annual Symposium on Foundations of Computer Science},
  year={2011},
  pages={170-179}
}
We give an O(n log3 n) algorithm that, given an n-node directed planar graph with arc capacities, a set of source nodes, and a set of sink nodes, finds a maximum flow from the sources to the sinks. Previously, the fastest algorithms known for this problem were those for general graphs. 
Maximum st-Flow in Directed Planar Graphs via Shortest Paths
NC Algorithms for Weighted Planar Perfect Matching and Related Problems
Approximate Maximum Flow on Separable Undirected Graphs
Short and Simple Cycle Separators in Planar Graphs
Minimum Cuts in Surface Graphs
Accelerated Bend Minimization
Indexing Point Sets for Approximate Bottleneck Distance Queries
  • B. Mumey
  • Computer Science, Mathematics
  • ArXiv
  • 2018
Efficient maximum flow algorithms
Detecting anomalous spatial interaction patterns by maximizing urban population carrying capacity
...
1
2
...

References

SHOWING 1-10 OF 50 REFERENCES
An O (n log n) algorithm for maximum st -flow in a directed planar graph
Boundary-to-Boundary Flows in Planar Graphs
Planar graphs, negative weight edges, shortest paths, and near linear time
Shortest Paths in Planar Graphs with Real Lengths in O(nlog2n/loglogn) Time
Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm
Maximum Flow in Directed Planar Graphs with Vertex Capacities
Single Source -- All Sinks Max Flows in Planar Digraphs
Multiple-Source Shortest Paths in Embedded Graphs
Flow in Planar Graphs with Vertex Capacities 1
Partition of planar flow networks
...
1
2
3
4
5
...