Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time

preprint2010arXivOpen access

We give an $O(n^{1.5} \log n)$ algorithm that, given a directed planar graph with arc capacities, a set of source nodes and a single sink node, finds a maximum flow from the sources to the sink . This is the first subquadratic-time strongly polynomial algorithm for the problem.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

Multiple-source single-sink maximum flow in directed planar graphs in O(n1.5log⁡n)O(n^{1.5} \log n)O(n1.5logn) time

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time