23: Algorithmen 2, Vorlesung und Übung, WS 2017/18, 29.01.2018
Author
Editor
Participating institute
Institut für Theoretische Informatik (ITI)
Genre
Description
- 0:00:00 Starten
- 0:07:03 Flüsse und Ford Fulkerson
- 0:08:39 Max Flow - Min Cut
- 0:12:42 Dinitz: Distanz Label
- 0:14:37 Dinitz: Schichtgraph
- 0:15:45 Dinitz: Blockierender Fluss
- 0:17:21 Dinitz: Blockierender Fluss Operationen
- 0:20:36 Dinitz: Kosten pro Blockierender Fluss
- 0:24:14 Dinitz: Laufzeit
- 0:25:37 Dinitz: Kosten pro Phase, Unit Capacity Network
- 0:30:24 Maximum Cardinality Bipartite Matching
- 0:31:35 Preflow-Push Algorithms
- 0:34:00 Level Function
- 0:36:49 Procedure genericPreflowPush
- 1:21:53 Searching for Eligible Edges
- 1:23:50 Satz 11. Arbitrary Preflow Push finds a maximum flow in time O (n²m)
Duration (hh:mm:ss)
01:26:58
Series
Algorithmen 2, Vorlesung, WS 2017/18
Published on
05.02.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 | 933640 bps |
| Color Space | yuv420p |
| Container | mov,mp4,m4a,3gp,3g2,mj2 |
| Media Type | video/mp4 |
| Duration | 5218 s |
| Filename | DIVA-2018-132_hd.mp4 |
| File Size | 608.935.465 byte |
| Frame Rate | 25 |
| Video Bitrate | 799546 bps |
| Video Codec | h264 |
Media URL
Embed Code
Algorithmen 2, Vorlesung, WS 2017/18
Episodes 1-26
of 26
