Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \log n)$ Time
Discrete Mathematics
2010-12-30 v1 Data Structures and Algorithms
Abstract
We give an algorithm that, given a 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.
Keywords
Cite
@article{arxiv.1012.5870,
title = {Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \log n)$ Time},
author = {Shay Mozes},
journal= {arXiv preprint arXiv:1012.5870},
year = {2010}
}
Comments
to be merged with 1) Yahav Nussbaum 1012.4767 2) Philip N. Klein and Shay Mozes 1008.5332 3) Glencora Borradaile and Christian Wulff-Nilsen 1008.4966