Algorithmen II, Übung, WS 2016/17, 16.11.2016, 09
Author
Editor
Participating institute
Institut für Theoretische Informatik (ITI)
Genre
Description
- 0:00:00 Starten
- 0:00:36 Themenübersicht
- 0:01:47 Nachklausur
- 0:02:16 Ford Fulkerson
- 0:02:20 Flüsse und Ford Fulkerson
- 0:07:45 Residualgraph
- 0:11:40 Flüsse und Ford Fulkerson
- 0:14:02 Max Flow - Min Cut
- 0:17:12 Dinitz Algorithmus
- 0:18:52 Dinitz - Distanz Label
- 0:22:38 Dinitz - Schichtgraph für Graph G = (V, E)
- 0:25:02 Dinitz - Blockierender Fluss
- 0:28:25 Dinitz - Blockierender Fluss: Operationen
- 0:33:25 Dinitz - Kosten pro Blockierender Fluss
- 0:38:12 Dinitz - Laufzeit
- 0:40:05 Dinitz - Kosten pro Phase - Unit Capacity Network
- 0:42:40 Dinitz - Anzahl Phasen - Unit Capacity Network
- 0:46:36 SCC (Widerholung)
- 1:03:07 Floyd Warshall: SCC als Speedup Technik
- 1:15:14 Floyd Warshall und SCC
Duration (hh:mm:ss)
01:19:27
Series
Algorithmen II, Vorlesung, WS 2016/17
Published on
22.11.2016
Subject area
License
| Resolution | 1280 x 720 Pixel |
| Aspect ratio | 16:9 |
| Audio bitrate | 127705 bps |
| Audio channels | 2 |
| Audio Codec | aac |
| Audio Sample Rate | 48000 Hz |
| Total Bitrate | 934013 bps |
| Color Space | yuv420p |
| Container | mov,mp4,m4a,3gp,3g2,mj2 |
| Media Type | video/mp4 |
| Duration | 4767 s |
| Filename | DIVA-2016-743_hd.mp4 |
| File Size | 4.096 byte |
| Frame Rate | 25 |
| Video Bitrate | 800215 bps |
| Video Codec | h264 |
Media URL
Embed Code
Algorithmen II, Vorlesung, WS 2016/17
Episodes 1-26
of 26
