07: Algorithmen II, Vorlesung, WS 2019/20, 04.11.2019
Author
Peter Sanders, Sebastian Lamm, Tobias Heuer
Editor
Zentrum für Mediales Lernen (ZML)
Participating institute
Institut für Theoretische Informatik (ITI)
Genre
Description
- 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
Duration (hh:mm:ss)
01:24:08
Series
Algorithmen II, Vorlesung, WS 2019/20
Published on
05.11.2019
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 | 934053 bps |
| Color Space | yuv420p |
| Container | mov,mp4,m4a,3gp,3g2,mj2 |
| Media Type | video/mp4 |
| Duration | 5048 s |
| Filename | DIVA-2019-830_hd.mp4 |
| File Size | 589.400.673 byte |
| Frame Rate | 25 |
| Video Bitrate | 799958 bps |
| Video Codec | h264 |
Media URL
Embed Code
