EPISODE · Nov 13, 2018 · 1H 20M
09: Algorithmen II, Vorlesung, WS 2018/19, 12.11.2018
from Algorithmen 2, Vorlesung, WS18/19 · host Prof. Dr. Peter Sanders
09 | 0:00:00 Start 0:00:09 Ford Fulkerson - Correctness 0:00:46 Ford Fulkerson Algorithm 0:08:49 Max-Flow-Min-Cut theorem 0:11:18 A bad example for Ford Fulkerson 0:13:25 Dinitz Algorithm 0:18:35 Dinitz-Correctness 0:21:22 Computing blocking flows 0:27:46 Blocking flows analysis 0:33:40 Dinitz analysis 0:40:55 Matching 0:43:54 Maximum cardinality bipartite matching 0:46:31 Similar performance for weight graphs? 0:50:06 Disadvantage of augmenting paths algorithms 0:52:10 Pre-flow-push algorithms 0:57:23 Level function 1:19:34 Partial correctness
What this episode covers
09 | 0:00:00 Start 0:00:09 Ford Fulkerson - Correctness 0:00:46 Ford Fulkerson Algorithm 0:08:49 Max-Flow-Min-Cut theorem 0:11:18 A bad example for Ford Fulkerson 0:13:25 Dinitz Algorithm 0:18:35 Dinitz-Correctness 0:21:22 Computing blocking flows 0:27:46 Blocking flows analysis 0:33:40 Dinitz analysis 0:40:55 Matching 0:43:54 Maximum cardinality bipartite matching 0:46:31 Similar performance for weight graphs? 0:50:06 Disadvantage of augmenting paths algorithms 0:52:10 Pre-flow-push algorithms 0:57:23 Level function 1:19:34 Partial correctness
NOW PLAYING
09: Algorithmen II, Vorlesung, WS 2018/19, 12.11.2018
No transcript for this episode yet
Similar Episodes
Jan 8, 2026 ·16m
Jan 2, 2026 ·12m
Aug 22, 2025 ·49m
Apr 29, 2025 ·12m
Apr 27, 2025 ·11m
Apr 24, 2025 ·11m