Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
We give an O(n log <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> 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 …