09: Algorithmen II, Vorlesung, WS 2018/19, 12.11.2018
Author
Editor
Participating institute
Institut für Theoretische Informatik (ITI)
Genre
Description
- 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
Duration (hh:mm:ss)
01:20:12
Series
Algorithmen II, Vorlesung, WS 2018/19
Published on
13.11.2018
Subject area
License
| Resolution | 1280 x 720 Pixel |
| Aspect ratio | 16:9 |
| Audio bitrate | 128000 bps |
| Audio channels | 2 |
| Audio Codec | aac |
| Audio Sample Rate | 48000 Hz |
| Total Bitrate | 934133 bps |
| Color Space | yuv420p |
| Container | mov,mp4,m4a,3gp,3g2,mj2 |
| Media Type | video/mp4 |
| Duration | 4812 s |
| Filename | DIVA-2018-832_hd.mp4 |
| File Size | 561.855.316 byte |
| Frame Rate | 25 |
| Video Bitrate | 800036 bps |
| Video Codec | h264 |
Media URL
Embed Code
Algorithmen II, Vorlesung, WS 2018/19
Episodes 1-30
of 30
