Learn · Computer Algorithms - 2
Lecture 11 of 35Computer Algorithms - 2
Lecture-11-Edmond Karp Algo
Prof. Shashank K. Mehta · IIT Kanpur
Credits and licence
- From
- Computer Algorithms - 2, IIT Kanpur (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Lecture-01-Graph_Basics
- Lecture-02-Breadth_First_Search
- Lecture-03-Dijkstra_Algo
- Lecture-04-All Pair Shortest Path
- Lecture-05-Matriods
- Lecture-06-Minimum Spanning Tree
- Lecture-07-Edmond's Matching Algo I
- Lecture-08-Edmond's Matching Algo II
- Lecture-09-Flow Networks
- Lecture-10-Ford Fulkerson Method
- Lecture-11-Edmond Karp Algo
- Lecture-12-Matrix Inversion
- Lecture-13-Matrix Decomposition
- Lecture-14-Knuth Morris Pratt Algo
- Lecture-15-Rabin Karp Algo
- Lecture-16-NFA Simulation
- Lecture-17-Integer-Polynomial OpsI
- Lecture-18-Integer-Polynomial OpsII
- Lecture-19-Integer-Polynomial OpsIII
- Lecture-20-Chinese RemainderI
- Lecture-21-Chinese RemainderII
- Lecture-22-Chinese RemainderIII
- Lecture-23-:Discrete Fourier TransformI
- Lecture-24-Discrete Fourier TransformII
- Lecture-25-Discrete Fourier TransformIII
- Lecture-26-Schonhage Strassen Algo
- Lecture-27-Linear ProgrammingI
- Lecture-28-Linear ProgrammingII
- Lecture-29-GeometryI
- Lecture-30-GeometryII
- Lecture-31-GeometryIII
- Lecture-32-Approximation AlgoI
- Lecture-33-Approximation AlgoII
- Lecture-34-Approximation AlgoIII
- Lecture-35-General: Dynamic Programming