References

Books

1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press. (Chapter 26: Maximum Flow)
2. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall.
3. Kleinberg, J., & Tardos, É. (2005). Algorithm Design. Pearson. (Chapter 7: Network Flow)

Research Papers

1. Ford, L. R., & Fulkerson, D. R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8, 399–404.
2. Edmonds, J., & Karp, R. M. (1972). Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19(2), 248–264.
3. Goldberg, A. V., & Tarjan, R. E. (1988). A new approach to the maximum-flow problem. Journal of the ACM, 35(4), 921–940.

Online Video Lectures

1. NPTEL: Algorithmic Graph Theory and Data Structures

   • Offered by: IIT Kharagpur
   • Instructor: Prof. Sourav Mukhopadhyay
   • Link: https://nptel.ac.in/courses/106105847

2. NPTEL (NOC): Design and Analysis of Algorithms

   • Offered by: Chennai Mathematical Institute
   • Instructor: Prof. Madhavan Mukund
   • Link: https://nptel.ac.in/courses/106106131