JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Finding the Maximum Flow in a Network with Simple Paths
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Finding the Maximum Flow in a Network with Simple Paths
Lee, Seung-Min; Lee, Chong-Hyung; Park, Dong-Ho;
  PDF(new window)
 Abstract
An efficient method is developed to obtain the maximum flow for a network when its simple paths are known. Most of the existing techniques need to convert simple paths into minimal cuts, or to determine the order of simple paths to be applied in the process to reach the correct result. In this paper, we propose a method based on the concepts of signed simple path and signed flow defined in the text. Our method involves a fewer number of arithmetic operations at each iteration, and requires fewer iterations in the whole process than the existing methods. Our method can be easily extended to a mixed network with a slight modification. Furthermore, the correctness of our method does not depend on the order of simple paths to be applied in the process.
 Keywords
Maximum flow;Flow augmenting path;Signed simple path;Signed flow;
 Language
English
 Cited by
 References
1.
IEEE Transactions on Reliability, 1988. vol.37. pp.65-69 crossref(new window)

2.
IEEE Transactions on Reliability, 1982. vol.31. pp.177-181 crossref(new window)

3.
Theory of Nets: Flows in Networks, 1990.

4.
IEEE Transactions on Reliability, 1998. vol.47. pp.44-48 crossref(new window)

5.
IEEE Transactions on Reliability, 2001. vol.50. pp.374-379 crossref(new window)

6.
IEEE Transactions on Reliability, 1982. vol.31. pp.174-176 crossref(new window)

7.
IEEE Transactions on Reliability, 1991. vol.40. pp.441-451 crossref(new window)

8.
IEEE Transactions on Reliability, 1995. vol.44. pp.620-621 crossref(new window)

9.
IEEE Transactions on Reliability, 1994. vol.43. pp.378-382 crossref(new window)