21: Algorithmen 2, Vorlesung und Übung, WS 2017/18, 16.01.2018
Author
Simon Gog, Yaroslav Akhremtsev
Editor
Participating institute
Institut für Theoretische Informatik (ITI)
Genre
Description
- 0:00:00 Starten
- 0:00:18 Maximum Flows and Matchings
- 0:00:37 Definitions: Network
- 0:02:23 Flows
- 0:06:45 Applications
- 0:07:19 Applications in our Group
- 0:14:39 Option 1: linear programming
- 0:16:09 Algorithms 1956-now
- 0:19:49 Example
- 0:24:55 Residual Graph
- 0:31:33 Ford Fulkerson Algorithm
- 0:43:36 Übung
- 0:44:35 SCC
- 0:55:06 Floyd Warshall: SCC als Speedup Technik
Duration (hh:mm:ss)
01:03:41
Series
Algorithmen 2, Vorlesung, WS 2017/18
Published on
18.01.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 | 933899 bps |
| Color Space | yuv420p |
| Container | mov,mp4,m4a,3gp,3g2,mj2 |
| Media Type | video/mp4 |
| Duration | 3821 s |
| Filename | DIVA-2018-47_hd.mp4 |
| File Size | 446.089.214 byte |
| Frame Rate | 25 |
| Video Bitrate | 799806 bps |
| Video Codec | h264 |
Media URL
Embed Code
Algorithmen 2, Vorlesung, WS 2017/18
Episodes 1-26
of 26
