09: Algorithmen II, Vorlesung, WS 2018/19, 12.11.2018
1 hour 20 minutes Posted Nov 13, 2018 at 4:40 pm.
Start
Ford Fulkerson Correctness
Ford Fulkerson Algorithm
Max-Flow-Min-Cut theorem
A bad example for Ford Fulkerson
Dinitz Algorithm
Dinitz-Correctness
Computing blocking flows
Blocking flows analysis
Dinitz analysis
Matching
Maximum cardinality bipartite matching
Similar performance for weight graphs?
Disadvantage of augmenting paths algorithms
Pre-flow-push algorithms
Level function
Partial correctness
0:00
1:20:12
Show notes
09 |
Watch Video
