Multiple source, single sink maximum flow in a planar graph

preprint2010arXivOpen access

We give an $O(n^{1.5}\log n)$ 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.

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 a planar graph

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0