Maximum st-flow in directed planar graphs via shortest paths
Data Structures and Algorithms
2013-05-27 v1 Discrete Mathematics
Combinatorics
Abstract
Minimum cuts have been closely related to shortest paths in planar graphs via planar duality - so long as the graphs are undirected. Even maximum flows are closely related to shortest paths for the same reason - so long as the source and the sink are on a common face. In this paper, we give a correspondence between maximum flows and shortest paths via duality in directed planar graphs with no constraints on the source and sink. We believe this a promising avenue for developing algorithms that are more practical than the current asymptotically best algorithms for maximum st-flow.
Cite
@article{arxiv.1305.5823,
title = {Maximum st-flow in directed planar graphs via shortest paths},
author = {Glencora Borradaile and Anna Harutyunyan},
journal= {arXiv preprint arXiv:1305.5823},
year = {2013}
}
Comments
20 pages, 4 figures. Short version to be published in proceedings of IWOCA'13