Multiple-source single-sink maximum flow in directed planar graphs in O(diameter ċ n log n) time

Authors:
Philip N. Klein;Shay Mozes
Affiliations:
Brown University, Providence, RI;Brown University, Providence, RI
Venue:
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Year:
2011

Citing 7
Cited 1

Flow in Planar Graphs with Multiple Sources and Sinks

SIAM Journal on Computing
Faster shortest-path algorithms for planar graphs

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision

IEEE Transactions on Pattern Analysis and Machine Intelligence
Multiple-source shortest paths in planar graphs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Maintaining information in fully dynamic trees with top trees

ACM Transactions on Algorithms (TALG)
An O(n log n) algorithm for maximum st-flow in a directed planar graph

Journal of the ACM (JACM)
Improved algorithms for min cut and max flow in undirected planar graphs

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

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 develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniques for flow problems. This gives rise to an O(diameter ċ nlogn) algorithm for the problem.