10: Parallele Algorithmen, Vorlesung, WS 2017/18, 08.01.2018
Author
Editor
Participating institute
Institut für Theoretische Informatik (ITI)
Genre
Description
- 0:00:00 Starten
- 0:00:10 Minimum Spannung Trees
- 0:03:06 Selecting and Discarding MST Edges
- 0:09:01 Kruskal's Algorithm
- 0:12:41 Edge Contraction
- 0:16:29 Finding lightest incident edges
- 0:24:06 Structure of Resulting Components
- 0:28:51 Pseudotrees -> Rooted Trees
- 0:31:07 Rooted Trees -> Rooted Stars by Doubling
- 0:32:43 Contraction
- 0:42:36 Recursion
- 0:45:21 Analysis
- 0:52:10 Randomized Linear Time Algorithm
- 0:55:08 Parallel Filter Kruskal
- 1:05:43 Running Time: Random graph with 2^16 nodes
- 1:09:12 More on Parallel MST
Duration (hh:mm:ss)
01:10:09
Series
Parallele Algorithmen, Vorlesung, WS 2017/18
Published on
11.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 | 758948 bps |
| Color Space | yuv420p |
| Container | mov,mp4,m4a,3gp,3g2,mj2 |
| Media Type | video/mp4 |
| Duration | 4209 s |
| Filename | DIVA-2018-12_hd.mp4 |
| File Size | 399.276.137 byte |
| Frame Rate | 25 |
| Video Bitrate | 624847 bps |
| Video Codec | h264 |
Media URL
Embed Code
Parallele Algorithmen, Vorlesung, WS 2017/18
Episodes 1-13
of 13
