Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time
Data Structures and Algorithms
2010-09-15 v2 Discrete Mathematics
Abstract
We give an algorithm that, given a directed planar graph with arc capacities, a set of source nodes and a single sink node, finds a maximum flow from the sources to the sink . This is the first subquadratic-time strongly polynomial algorithm for the problem.
Keywords
Cite
@article{arxiv.1008.5332,
title = {Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time},
author = {Philip N. Klein and Shay Mozes},
journal= {arXiv preprint arXiv:1008.5332},
year = {2010}
}
Comments
13 pages, 2 figures. Corrected spelling in one citation