Answers are grounded in this paper and cite their sources.
We give an O(n log³ 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.
No takes yet. Share an insight, caveat, or question.
Borradaile et al. (2017) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: