An Efficient Algorithm for Finding Maximum Flow in a Network-Flow

Please use this identifier to cite or link to this item: https://ir.vidyasagar.ac.in/jspui/handle/123456789/912

Full metadata record

DC Field	Value	Language
dc.contributor.author	Ahmed, Faruque
dc.contributor.author	Khan, Md. Al-Amin
dc.contributor.author	Khan, Aminur Rahman
dc.contributor.author	Ahmed, Syed Sabbir
dc.contributor.author	Uddin, Md. Sharif
dc.date.accessioned	2016-12-22T17:40:21Z	-
dc.date.available	2016-12-22T17:40:21Z	-
dc.date.issued	2014-12-26
dc.identifier.issn	2350-0352
dc.identifier.uri	http://inet.vidyasagar.ac.in:8080/jspui/handle/123456789/912	-
dc.description.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	en_US
dc.language.iso	en_US	en_US
dc.publisher	Vidyasagar University , Midnapore , West-Bengal , India	en_US
dc.relation.ispartofseries	Journal of Physical Science;19
dc.subject	Maximal-Flow Model	en_US
dc.subject	Residual network	en_US
dc.subject	Residual Capacity	en_US
dc.subject	Augmenting Path	en_US
dc.subject	Source-Sink cut	en_US
dc.subject	Source-Sink cut capacity	en_US
dc.subject	Bounded variable simplex method	en_US
dc.title	An Efficient Algorithm for Finding Maximum Flow in a Network-Flow	en_US
dc.type	Article	en_US
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