Network Flows Algorithms

Code: MA503 | L-T-P-C: 3-0-0-6

Prerequisites: MA501 Discrete Mathematics (Graph theory part), MA591 Optimization Techniques

Graph notations and computer representations, Applications to various disciplines, Worst-case complexity. Shortest paths, Label setting and label correcting algorithms, Maximum flows, Augmenting path and pre flow push algorithms, Minimum cost flows. Pseudopolynomial and polynomial time algorithms, Assignments and matching, Bipartite and nonbipartite matchings, Minimum spanning trees, Convex cost flows and generalized flows, Emphasis on real-life time applications of network flows and state-of-the art algorithms.

Texts:

1. R. K. Ahuja, T. L. Magnanti and J. B. Orlin, Network Flows: Theory Applications and Algorithms, Prentice Hall, 1993.
2. L.R. Ford and D.R. Fulkerson, Flows in Networks, Princeton University Press, 1962.
3. A. Dolan, Networks and Algorithms, John Wiley and Sons, 1993.
4. M.N.S. Swamy and K. Thulasiraman, Graphs, Networks and Algorithms, Wiley, 1981.