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

Glencora Borradaile,Philip N Klein,Christian Wulff-Nilsen,Yahav Nussbaum,Shay Mozes

doi:10.1109/focs.2011.73

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

Glencora Borradaile, Philip N Klein + Show 3 more

Open Access

https://doi.org/10.1109/focs.2011.73

Copy DOI

Publication Date: Oct 1, 2011

Citations: 82

Affiliation: John Brown University, University of Southern Denmark, Tel Aviv University, Oregon State University

#Set Of Sink Nodes #Directed Planar Graph + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

We give an O(n log <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> 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.

Full Text