Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \log n)$ Time

Details Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \log n)$ Time Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \log n)$ Time

2010-12-29

arxiv.org/abs/1012.5870v1

Computer Science

Discrete Mathematics

to be merged with 1) Yahav Nussbaum 1012.4767 2) Philip N. Klein and Shay Mozes 1008.5332 3) Glencora Borradaile and Christian

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

Affiliated with

Also associated with

No associations

Rating

Multiple-Source Multiple-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 Multiple-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 Multiple-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-610179