## Computer Algorithms 2

Computer Algorithms 2. Instructor: Prof. Dr. Shashank K. Mehta, Department of Computer Science and Engineering, IIT Kanpur. The course discusses efficient algorithms from a large number of domains. This course assumes the knowledge of data-structures, the knowledge big-O notation and the concept of time and space complexity of an algorithm. And also it will not introduce divide and conquer, dynamic programming, and greedy paradigms. This course will discuss graph algorithms, network-flow algorithms, geometric algorithms, string matching, matrix algorithms, polynomial computation algorithms, and number theoretic algorithms.
(from **nptel.ac.in**)

Lecture 11 - Edmonds-Karp Algorithm |

Go to **the Course Home** or watch other lectures: