09: Algorithmen II, Vorlesung, WS 2018/19, 12.11.2018 - a podcast by Karlsruher Institut für Technologie (KIT)

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

Further episodes of Algorithmen 2, Vorlesung, WS18/19

Further podcasts by Karlsruher Institut für Technologie (KIT)

Website of Karlsruher Institut für Technologie (KIT)