Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*log(n)) Time

Details Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*log(n)) Time Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*log(n)) Time

2011-04-25

arxiv.org/abs/1104.4728v2

Computer Science

Discrete Mathematics

proofs included. preliminary version to appear in WADS 2011

Scientific paper

We develop a new technique for computing maximum flow in directed planar
graphs with multiple sources and a single sink that significantly deviates from
previously known techniques for flow problems. This gives rise to an
O(diameter*n*log(n)) algorithm for the problem.

Affiliated with

Also associated with

No associations

Rating

Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*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(diameter*n*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(diameter*n*log(n)) Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-545239