Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*log(n)) Time
Discrete Mathematics
2011-05-11 v2 Data Structures and Algorithms
Abstract
We develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniques for flow problems. This gives rise to an O(diameter*n*log(n)) algorithm for the problem.
Keywords
Cite
@article{arxiv.1104.4728,
title = {Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*log(n)) Time},
author = {Philip N. Klein and Shay Mozes},
journal= {arXiv preprint arXiv:1104.4728},
year = {2011}
}
Comments
proofs included. preliminary version to appear in WADS 2011