An Alternate Simple Approach to Obtain the Maximum Flow in a Network Flow Problem

dc.contributor.author	Dash, Protima
dc.contributor.author	Rahman, Md. Mosfiqur
dc.contributor.author	Zohora, F.T.
dc.date.accessioned	2019-05-19T07:08:16Z
dc.date.available	2019-05-19T07:08:16Z
dc.date.issued	2018
dc.identifier.issn	1816-949x
dc.identifier.uri	http://hdl.handle.net/123456789/91
dc.description.abstract	The implementation version of Ford Fulkerson algorithm is known as Edmonds-Karp algorithm. The concept of Edmonds-Karp is to use BFS (Breadth First Search) in Ford Fulkerson execution as BFS always choices a path with least. This study likewise is a change form of Edmonds-Karp algorithm. In this study, we need to present an alternate approach for finding the maximum flow concerning less number of iterations and augmentation than Edmonds-Karp algorithm. A numerical illustration is appeared for showing the proposed algorithm to finding the maximal-flow problem by a Breadth First Search (BFS) method.	en_US
dc.language.iso	en_US	en_US
dc.publisher	MEDWELL PUBLICATIONS	en_US
dc.subject	Alternate Simple Approach	en_US
dc.subject	Maximum Flow	en_US
dc.subject	Network Flow Problem	en_US
dc.title	An Alternate Simple Approach to Obtain the Maximum Flow in a Network Flow Problem	en_US
dc.type	Article	en_US