Keywords:-

Keywords: Network flow, minimum flow problem, residual capacity, gain function.

Article Content:-

Abstract

In any traditional network, there is an implicit assumption that flow is conserved on every arc. In generalized networks, each arc has a positive multiplier (u,v) called a gain factor, associated with it, representing the fraction of flow that remains when it is sent along that arc. The generalized maximum flow
problem is identical to the traditional maximum flow problem, except that it can also model network with “leak” flow. In this paper, an algorithm is designed for the generalized minimum flow problem that consists of applying a maximum flow algorithm by modifying the network. This algorithm always decreases flow along paths from source vertex to the sink vertex with sufficiently large residual capacity and it runs in O (EV) time.

References:-

References

R. Ahuja, T. Magnanti and J. Orlin, Network Flows: Theory, Algorithms and Applications

Prentice Hall, Inc., Englewood Cliffs, NY, 1993.

E. Ciurea and L. Ciupala, Algorithms for minimum flows, Computer Science Journal of

Moldova 9, No.3 (27), 2001, pp. 275-290.

E. Ciurea and L. Ciupala, Sequential and parallel algorithms for minimum flows, Journal

of Applied Mathematics and Computing, Vol. 15, No. 1-2, 2004, pp. 53–75. 4. E. Ciurea, O. Georgescu and D. Marinescu, Improved Algorithms for minimum flows in

bipartite networks, International Journal of Computers, issue 4, volume 15, 2008, 351-360.

H. S. Wolf, Algorithms and Complexity, Prentice Hall International, Inc., U. S. A. 1986.

A. Anto Kinsley and B. Uma Maheswari, Design of algorithms to Generalized Maximum

flow network Problem, International Journal of Advanced Research in Computer Science

and Technology(IJARCST 2016) Vol.4,Issue 1 (Jan. – Mar 2016) pp:31- 34.

A. Anto Kinsley and B. Uma Maheswari, A Pre-Flow Push algorithm to Generalsed Maximum

flow Problem International Journal of Engineering Science and Research Technology (IJESRT)

Feb. 2016 pp:547-553.

Downloads

Citation Tools

How to Cite
Kinsley, A. A., & Maheswari, B. U. (2017). Design of algorithms to Generalized Minimum Flow Network Problem. International Journal Of Mathematics And Computer Research, 5(09), 1797-1807. Retrieved from https://ijmcr.in/index.php/ijmcr/article/view/32