Skip to main content
Conference Proceedings

Multiple-source single-sink maximum flow in directed planar graphs in O(diameter·n log n) time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6844 LNCS 571-582
DOI: 10.1007/978-3-642-22300-6_48
2Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

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 algorithm for the problem. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Klein, P. N., & Mozes, S. (2011). Multiple-source single-sink maximum flow in directed planar graphs in O(diameter·n log n) time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6844 LNCS, pp. 571–582). https://doi.org/10.1007/978-3-642-22300-6_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free