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

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

2010-08-31

arxiv.org/abs/1008.5332v2

Computer Science

Data Structures and Algorithms

13 pages, 2 figures. Corrected spelling in one citation

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180791