Multiple-Source Multiple-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 set of sink nodes, finds a maximum flow from the sources to the sinks.

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 Multiple-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 Multiple-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 Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \log n)$ Time