A PRE-FLOW PUSH ALGORITHM TO GENERALIZED MAXIMUM FLOW PROBLEM

Abstract

 This work presents an algorithm for the generalized maximum flow problem. First, we describe the traditional maximum flow problem. Pre-flow Push algorithms work in a more localized manner than the Ford-Fulkerson method. These algorithms maintain at all stages a feasible pre-flow that has a saturated cut. The pre-flow is changed step by step until it does satisfy flow conservation. The resulting flow then has a saturated cut so is a maximum flow. 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.

Authors and Affiliations

A. Anto Kinsley

Keywords

Related Articles

 Research on Analysis of Hindi language Graphical user Interface

 The interface between humans and computers is an ever critical issue due to the increased complexity of computerized systems and the wide variety of problems they solve. Controlled natural languages might prove a...

 Study of Computer in Smart Antenna System: A Comprehensive Approach

 In the recent years, advancement in telecommunication technologies and the increasing demand of data rate has motivated the optimized use of frequency spectrum. One technique for the efficient usage of frequency i...

 Advanced AODV Routing Algorithm with Energy Efficiency in MANET

 Adhoc network are miscellany of dynamic nodes which are self configuring without any framework and mobile devices are connected by wireless network.[1] Adhoc network allows different wireless mobile devices to co...

 Generalized Beta Homeomorphisms in Intuitionistic Fuzzy Topological Spaces

 In this paper we introduce the new class of homeomorphisms called generalized beta homeomorphisms in intuitionistic fuzzy topological spaces. We also introduce M-generalized beta homeomorphisms in intuitionistic...

 Research on Friendly ARM Board for Data Transfer between Two USB Devices without Computer

 The project aims to develop a device that allows file transfers between two USB memory devices without the need for a personal Computer. It is designed as a standalone application which allows for the backup of fi...

Download PDF file
  • EP ID EP159206
  • DOI -
  • Views 108
  • Downloads 0

How To Cite

A. Anto Kinsley (0).  A PRE-FLOW PUSH ALGORITHM TO GENERALIZED MAXIMUM FLOW PROBLEM. International Journal of Engineering Sciences & Research Technology, 5(2), 547-553. https://europub.co.uk/articles/-A-159206