21: Algorithmen 1, Übung, SS 2018, 04.07.2018
Author
Editor
Participating institute
Institut für Theoretische Informatik (ITI)
Genre
Description
- 0:00:00 Start
- 0:02:30 Dijkstras Algorithmus
- 0:10:26 Bellman Ford Algorithmus
- 0:22:16 Minimale Spannbäume
- 0:27:49 Steinerbäume
- 0:35:38 Problem des Handlungsreisenden (TSP)
Duration (hh:mm:ss)
00:41:46
Series
Algorithmen 1, Vorlesung, SS 2018
Published on
09.07.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 | 934183 bps |
| Color Space | yuv420p |
| Container | mov,mp4,m4a,3gp,3g2,mj2 |
| Media Type | video/mp4 |
| Duration | 2506 s |
| Filename | DIVA-2018-531_hd.mp4 |
| File Size | 292.680.236 byte |
| Frame Rate | 25 |
| Video Bitrate | 800088 bps |
| Video Codec | h264 |
Media URL
Embed Code
Algorithmen 1, Vorlesung, SS 2018
Episodes 1-23
of 23
