An O (n log n) algorithm for maximum st-flow in a directed planar graph

Authors:
Glencora Borradaile;Philip Klein
Affiliations:
Brown University;Brown University
Venue:
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Year:
2006

Citing 14
Cited 9

A data structure for dynamic trees

Journal of Computer and System Sciences
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Maintenance of a minimum spanning forest in a dynamic plane graph

Journal of Algorithms
The lattice structure of flow in planar graphs

SIAM Journal on Discrete Mathematics
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
Maximum (s,t)-flows in planar networks in O(|V| log |V|) time

Journal of Computer and System Sciences
The vertex-disjoint menger problem in planar graphs

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Randomized fully dynamic graph algorithms with polylogarithmic time per operation

Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM (JACM)
Planar Graphs, Negative Weight Edges, Shortest Paths, and Near Linear Time

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Dynamizing static algorithms, with applications to dynamic trees and history independence

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Multiple-source shortest paths in planar graphs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Self-adjusting top trees

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

Maximum s-t-flow with k crossings in O(k3n log n) time

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Homology flows, cohomology cuts

Proceedings of the forty-first annual ACM symposium on Theory of computing
Minimum cuts and shortest homologous cycles

Proceedings of the twenty-fifth annual symposium on Computational geometry
Two-phase greedy algorithms for some classes of combinatorial linear programs

ACM Transactions on Algorithms (TALG)
Lattices and maximum flow algorithms in planar graphs

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
On greedy and submodular matrices

TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Solving multilabel MRFs using incremental α-expansion on the GPUs

ACCV'09 Proceedings of the 9th Asian conference on Computer Vision - Volume Part III
Counting and sampling minimum cuts in genus g graphs

Proceedings of the twenty-ninth annual symposium on Computational geometry

Quantified Score

Hi-index	0.01

Visualization

Abstract

We give the first correct O(n log n) algorithm for finding a maximum st-flow in a directed planar graph. After a preprocessing step that consists in finding single-source shortest-path distances in the dual, the algorithm consists of repeatedly saturating the leftmost residual s-to-t path.