Multiple source, single sink maximum flow in a planar graph
Discrete Mathematics
2010-09-03 v1 Data Structures and Algorithms
Abstract
We give an time algorithm for finding the maximum flow in a directed planar graph with multiple sources and a single sink. The techniques generalize to a subquadratic time algorithm for bounded genus graphs.
Keywords
Cite
@article{arxiv.1008.4966,
title = {Multiple source, single sink maximum flow in a planar graph},
author = {Glencora Borradaile and Christian Wulff-Nilsen},
journal= {arXiv preprint arXiv:1008.4966},
year = {2010}
}