SIAM Journal on Computing · 2017 · 41 citations · 27 references
ComputingComputer ScienceAlgorithmsComputational GeometryParallel AlgorithmsCombinatorial OptimizationGraph AlgorithmsNetwork Flow AlgorithmsNetwork FlowsSublinear AlgorithmsDirected GraphsMaximum FlowMaximum Flow AlgorithmsMaximum Flow ProblemsNetwork Flow ProblemsPlanar Graph AlgorithmsPlanar Graphs
We give an $O(n \log^3 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.
27
A new approach to the maximum-flow problem
Andrew V. Goldberg, Robert E. Tarjan · Journal of the ACM · 1988 · 1.9K citations · Full text