Title :Design of algorithms to Generalized Minimum Flow Network Problem

Authors : 1Anto Kinsley , 2B. Uma Maheswari,

DOI : http://dx.doi.org/10.18535/ijmcr/v5i9.01


Download Full Text Article

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 g(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.

Call For Paper

Call for paper

Volume 5 Issue 9 September 2017

 Read More

Crossref - DOI

DOI : 10.18535/ijmcr

Social Link

Coming Soon

About Us

IJMCR is a scholarly open access, peer-reviewed, interdisciplinary, monthly and fully refereed journal focusing on theories, methods and applications in Mathematical and Computational Sciences.

Go to top