References

Ahmed, F., M. Khan, A.R. Khan, S.S. Ahmed and M. Uddin, 2014. An efficient algorithm for finding maximum flow in a network-flow. J. Phys. Sci., 19: 41-50.
Direct Link  |  

Ahuja, R.K. and J.B. Orlin, 1989. A fast and simple algorithm for the maximum flow problem. Oper. Res., 37: 748-759.
CrossRef  |  Direct Link  |  

Ahuja, R.K., J.B. Orlin and R.E. Tarjan, 1989. Improved time bounds for the maximum flow problem. SIAM. J. Comput., 18: 939-954.
CrossRef  |  Direct Link  |  

Dinic, E.A., 1970. Algorithm for solution of a problem of maximum flow in networks with power estimation. Sov. Math. Dokl., 11: 1277-1280.
Direct Link  |  

Edmonds, J. and R.M. Karp, 1972. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM., 19: 248-264.
CrossRef  |  Direct Link  |  

Ford, L.R. and D.R. Fulkerson, 1956. Maximal flow through a network. Can. J. Math., 8: 399-404.
Direct Link  |  

Ford, L.R. and D.R. Fulkerson, 1962. Flows in Networks. Princeton University Press, Princeton, New Jersey, USA., Pages: 194.

Fulkerson, D.R. and G.B. Dantzig, 1955. Computation of maximum flow in network. Nav. Res. Logist. Q., 2: 277-283.
CrossRef  |  Direct Link  |  

Harris, T.E. and F.S. Ross, 1955. Fundamentals of a method for evaluating rail net capacities (No. RM-1573). Rand Corporation, Santa Monica, California.

Jain, C. and D. Garg, 2012. Improved edmond karps algorithm for network flow problem. Intl. J. Comput. Appl., 37: 48-53.
CrossRef  |  Direct Link  |  

Khan, M., A. Rashid, A.R. Khan and M.S. Uddin, 2013. An innovative approach for solving maximal-flow problems. J. Phys. Sci., 17: 143-154.
Direct Link  |  

Mallick, K.K., A.R. Khan, M.M. Ahmed, M.S. Arefin and M.S. Uddin, 2016. Modified EDMONDS-KARP algorithm to solve maximum flow problems. Open J. Appl. Sci., 6: 131-140.
CrossRef  |  Direct Link  |