07: Algorithmen II, Vorlesung, WS 2019/20, 04.11.2019
An episode of the Algorithmen 2, Vorlesung, WS19/20 podcast, hosted by Prof. Dr. Peter Sanders, titled "07: Algorithmen II, Vorlesung, WS 2019/20, 04.11.2019" was published on November 5, 2019 and runs 84 minutes.
November 5, 2019 ·84m · Algorithmen 2, Vorlesung, WS19/20
Summary
07 | 0:00:00 Start 0:02:01 Maximum Flows and Matchings 0:05:38 Network 0:07:41 Flows 0:12:54 s-t Cuts 0:14:33 Anwendung 0:31:49 Lösungsmöglichkeiten 0:45:39 Beispiel 0:49:42 Residual Graph 0:51:51 Augmenting Paths 0:53:19 Ford Fulkerson Algorithm 0:54:44 Ford Fulkerson - Correctness 1:04:19 Max-Flow-Min-Cut theorem 1:13:34 Blocking Flows 1:16:04 Dinitz Algorithm 1:18:45 Dinitz - Correctness 1:19:32 Beispiel
Episode Description
Similar Episodes
Feb 7, 2019 ·86m
Feb 4, 2019 ·82m
Jan 31, 2019 ·70m
Jan 29, 2019 ·86m
Jan 24, 2019 ·85m
Jan 22, 2019 ·85m