Developing Algorithm to Obtain the Maximum Flow in a Network Flow Problem

dc.contributor.author	Dash, Protima
dc.contributor.author	Rahman, Md. Mosfiqur
dc.contributor.author	Akter, M. Sharmin
dc.date.accessioned	2022-02-02T09:39:00Z
dc.date.available	2022-02-02T09:39:00Z
dc.date.issued	2019
dc.identifier.uri	http://dspace.daffodilvarsity.edu.bd:8080/handle/123456789/6967
dc.description.abstract	In this paper we want to introduce a different approach for finding the maximum flow of a maximal- flow problem involving less number of iterations and augmentations than Edmonds- Karp algorithm. A numerical example is shown for demonstrating the proposed method and worked out the maximal-flow problem as a Breadth First Search (BFS).	en_US
dc.language.iso	en_US	en_US
dc.publisher	Journal of Advanced Research in Dynamical and Control Systems	en_US
dc.subject	Maximum flow	en_US
dc.subject	Maximum	en_US
dc.title	Developing Algorithm to Obtain the Maximum Flow in a Network Flow Problem	en_US
dc.type	Article	en_US