Multiple source, single sink maximum flow in a planar graph

Details Multiple source, single sink maximum flow in a planar graph Multiple source, single sink maximum flow in a planar graph

2010-08-29

arxiv.org/abs/1008.4966v1

Computer Science

Discrete Mathematics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Multiple source, single sink maximum flow in a planar graph 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 a planar graph, 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 a planar graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-399744