Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
A data structure for dynamic trees
Journal of Computer and System Sciences
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
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Journal of the ACM (JACM)
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Recent Developments in Maximum Flow Algorithms (Invited Lecture)
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
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
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)
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
Finding shortest non-trivial cycles in directed graphs on surfaces
Proceedings of the twenty-sixth annual symposium on Computational geometry
Maximum flows and parametric shortest paths in planar graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Counting minimum (s, t)-cuts in weighted planar graphs in polynomial time
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Shortest vertex-disjoint two-face paths in planar graphs
ACM Transactions on Algorithms (TALG)
Shortest non-trivial cycles in directed surface graphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
Computing the girth of a planar graph in linear time
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Multiple-source single-sink maximum flow in directed planar graphs in O(diameter ċ n log n) time
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Global minimum cuts in surface embedded graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Counting and sampling minimum (s,t)-cuts in weighted planar graphs in polynomial time
Theoretical Computer Science
Minimum cuts and shortest non-separating cycles via homology covers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
GD'11 Proceedings of the 19th international conference on Graph Drawing
Contraction network for solving maximum flow problem
Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics
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
| Hi-index | 0.01 |
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.