11: Parallele Algorithmen, Vorlesung, WS 2017/18, 15.01.2018
Author
Editor
Participating institute
Institut für Theoretische Informatik (ITI)
Genre
Description
- 0:00:00 Starten
- 0:00:14 Finding lightest incident edges
- 0:01:19 Pseudotrees - Rooted Trees
- 0:03:00 Randomized Linear Time Algorithm
- 0:04:24 Parallel Filter Kruskal
- 0:05:40 Parallele Prioritätlisten
- 0:10:34 Naive Implementierung
- 0:11:30 Branch-and-Bound
- 0:25:18 Sequentielles Branch-and-Bound
- 0:35:27 Paralleles Branch-and-Bound
- 0:38:20 Analyse
- 0:52:09 Der Algorithmus von Karp und Zhang
- 1:01:47 Einfache Probabilistische Eigenschaften
- 1:04:01 Parallele Realisierung I
- 1:16:04 Parallele Realisierung II
Duration (hh:mm:ss)
01:27:27
Series
Parallele Algorithmen, 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 | 656694 bps |
| Color Space | yuv420p |
| Container | mov,mp4,m4a,3gp,3g2,mj2 |
| Media Type | video/mp4 |
| Duration | 5247 s |
| Filename | DIVA-2018-45_hd.mp4 |
| File Size | 430.691.556 byte |
| Frame Rate | 25 |
| Video Bitrate | 522594 bps |
| Video Codec | h264 |
Media URL
Embed Code
Parallele Algorithmen, Vorlesung, WS 2017/18
Episodes 1-13
of 13
