Please use this identifier to cite or link to this item:
https://ir.vidyasagar.ac.in/jspui/handle/123456789/912
Title: | An Efficient Algorithm for Finding Maximum Flow in a Network-Flow |
Authors: | Ahmed, Faruque Khan, Md. Al-Amin Khan, Aminur Rahman Ahmed, Syed Sabbir Uddin, Md. Sharif |
Keywords: | Maximal-Flow Model Residual network Residual Capacity Augmenting Path Source-Sink cut Source-Sink cut capacity Bounded variable simplex method |
Issue Date: | 26-Dec-2014 |
Publisher: | Vidyasagar University , Midnapore , West-Bengal , India |
Series/Report no.: | Journal of Physical Science;19 |
Abstract: | This paper aims to introduce a new efficient algorithmic approach for finding the maximum flow of a maximal flow problem requiring less number of iterations and augmentation than Ford-Fulkerson algorithm |
URI: | http://inet.vidyasagar.ac.in:8080/jspui/handle/123456789/912 |
ISSN: | 2350-0352 |
Appears in Collections: | Journal of Physical Sciences Vol.19 [2014] |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
JPS-v19-5.pdf | 214.76 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.