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

Authors:
Glencora Borradaile;Philip N. Klein;Shay Mozes;Yahav Nussbaum;Christian Wulff-Nilsen
Affiliations:
-;-;-;-;-
Venue:
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Year:
2011

Citing 0
Cited 5

Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Accelerated bend minimization

GD'11 Proceedings of the 19th international conference on Graph Drawing
Optimal uniformly monotone partitioning of polygons with holes

Computer-Aided Design
A simple reduction from maximum weight matching to maximum cardinality matching

Information Processing Letters
Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.