A Study on Network Flow and finding maximum flow using Ford Fulkerson Algorithm

Authors

  • H. Haseena Begum  Department of Mathematics, Dr. Sns Rajalakshmi College of Arts and Science, Coimbatore, Tamilnadu, India
  • V. Hemalatha  Department of Mathematics, Dr. Sns Rajalakshmi College of Arts and Science, Coimbatore, Tamilnadu, India

Keywords:

Network Flow, Residual Network, Residual Capacity, Augmenting Path.

Abstract

Ford-Fulkerson algorithm is widely used to solve maximum Graph-Flow problems and it can be applied to a range of different areas, including networking. This project proposes an approach based on Ford-Fulkerson algorithm to maximize the flow of computer network. Such method mitigates congestion problems and increases network utilization. In order to show the applicability of the proposed approach, this project presents the analysis of network scenarios.

References

  1. A.V. Goldberg, E. Tardos and R.E. Tarjan "Network Flow algorithms"
  2. Malhotra, V.M.:Kumar, M.Pramodh, "Algorithm for finding flows in Networks"
  3. Prof. Soumen Maity "Department of Mathematics", NPTEL online course, IISER Pune.

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2018-02-28

Issue

Volume 4, Issue 1, January-February-2018

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
H. Haseena Begum, V. Hemalatha "A Study on Network Flow and finding maximum flow using Ford Fulkerson Algorithm" International Journal of Scientific Research in Science, Engineering and Technology (IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 4, Issue 1, pp.1401-1403, January-February-2018.