An O (n log n) algorithm for maximum st-flow in a directed planar graph
From MaRDI portal
Publication:3581580
DOI10.1145/1109557.1109615zbMath1192.05153OpenAlexW4252072354MaRDI QIDQ3581580
Glencora Borradaile, Philip N. Klein
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109615
Related Items
Minimum Cuts in Surface Graphs ⋮ Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities ⋮ A ranking model for the greedy algorithm and discrete convexity ⋮ Counting and sampling minimum cuts in genus \(g\) graphs ⋮ Greedy oriented flows ⋮ Lattices and Maximum Flow Algorithms in Planar Graphs
This page was built for publication: An O (n log n) algorithm for maximum st-flow in a directed planar graph