CSE201, Lec 18: Cuts and flows

preview_player
Показать описание
We start with a high-level discussion of cuts and flows. We talk in detail about the maxflow problem, and describe the Ford-Fulkerson algorithm.

We do a short segment on the history of linear programming and the connection to the maxflow problem.
  1. C. Seshadhri
Рекомендации по теме
CSE201, Lec 18: 1:25:23

CSE201, Lec 18: Cuts and flows

CSE201, Lec 17: 1:30:56

CSE201, Lec 17: An introduction to NP-completeness and the connection with optimization problems

CSE201, Lec 16: 1:30:18

CSE201, Lec 16: The nlog n lower bound for comparison based sorters

recursion, memoization and 0:11:31

recursion, memoization and looping | Dynamic Programming Part 1

Truth Table Tutorial 0:07:51

Truth Table Tutorial - Discrete Mathematics Logic

TCS+ talk: C. 1:04:48

TCS+ talk: C. Seshadhri

Most Expected Questions 3:21:15

Most Expected Questions on COA | Marathon from GATE AIR 19 | GATE 2021 CSE Exam | Vishvadeep Sir