Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
Discrete Mathematics
2011-05-12 v1 Data Structures and Algorithms
Abstract
We give an O(n log^3 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.
Cite
@article{arxiv.1105.2228,
title = {Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time},
author = {Glencora Borradaile and Philip N. Klein and Shay Mozes and Yahav Nussbaum and Christian Wulff-Nilsen},
journal= {arXiv preprint arXiv:1105.2228},
year = {2011}
}
Comments
18 pages, 1 figure