Finding a Feasible Flow in a Strongly Connected Network

Details Finding a Feasible Flow in a Strongly Connected Network Finding a Feasible Flow in a Strongly Connected Network

2007-11-17

arxiv.org/abs/0711.2710v2

Computer Science

Data Structures and Algorithms

4 pages, submitted to Operations Research Letters, minor updates: typos corrected, speed-up = improvement of the worst-case ti

Scientific paper

We consider the problem of finding a feasible single-commodity flow in a strongly connected network with fixed supplies and demands, provided that the sum of supplies equals the sum of demands and the minimum arc capacity is at least this sum. A fast algorithm for this problem improves the worst-case time bound of the Goldberg-Rao maximum flow method by a constant factor. Erlebach and Hagerup gave an linear-time feasible flow algorithm. We give an arguably simpler one.

Affiliated with

Also associated with

No associations

Rating

Finding a Feasible Flow in a Strongly Connected Network 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 Finding a Feasible Flow in a Strongly Connected Network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding a Feasible Flow in a Strongly Connected Network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-60937