MIT

Lecture 13: Incremental Improvement: Max Flow, Min Cut

Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresNetworks and SecurityComputer ScienceScience & MathMathematics

Om kurset

Description: In this lecture, Professor Devadas introduces network flow, and the Max Flow, Min Cut algorithm. Instructors: Srinivas Devadas