EPISODE · Nov 5, 2019 · 1H 24M
07: Algorithmen II, Vorlesung, WS 2019/20, 04.11.2019
from Algorithmen 2, Vorlesung, WS19/20 · host Prof. Dr. Peter Sanders
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
What this episode covers
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
NOW PLAYING
07: Algorithmen II, Vorlesung, WS 2019/20, 04.11.2019
No transcript for this episode yet
Similar Episodes
Feb 24, 2026 ·13m
Feb 17, 2026 ·9m
Feb 11, 2026 ·7m
Feb 4, 2026 ·18m
Feb 3, 2026 ·7m
Jan 27, 2026 ·8m