Algorithmen II, Vorlesung, WS 2016/17, 15.11.2016, 08
Author
Editor
Participating institute
Institut für Theoretische Informatik (ITI)
Genre
Description
- 0:00:00 Starten
- 0:00:18 Wiederholung Starke Zusammenhangskomponenten
- 0:05:26 Wiederholung Tiefensuchschema
- 0:13:12 5 Maximum Flows and Matchings
- 0:14:57 Definitions: Network
- 0:16:04 Definitions: Flows
- 0:18:46 Definitions: (Minimum) s-t Cuts
- 0:20:12 Duality Between Flows and Cuts
- 0:21:21 Applications
- 0:22:11 Applications in our Group
- 0:22:34 Exkurs: Balanced Bipartitioning
- 0:27:24 Example
- 0:28:58 Option 1: linear programming
- 0:32:33 Algorithms 1956-now
- 0:34:00 Augmenting Paths (Rough Idea)
- 0:34:59 Example
- 0:35:49 Residual Graph
- 0:38:51 Augmenting Paths
- 0:39:40 Ford Fulkerson Algorithm
- 0:59:36 A Bad Example for Ford Fulkerson
- 1:00:35 An Even Worse Example for Ford Fulkerson
- 1:03:05 Dinitz Algorithmus
- 1:19:41 Example
- 1:20:38 Block Flows Analysis 1
- 1:22:59 Blocking Flows Analysis 2
- 1:23:23 Blocking Flows Analysis 3
- 1:23:49 Dinitz Analysis 1
- 1:24:09 Dinitz Analysis 2
Duration (hh:mm:ss)
01:24:52
Series
Algorithmen II, Vorlesung, WS 2016/17
Published on
22.11.2016
Subject area
License
| Resolution | 1280 x 720 Pixel |
| Aspect ratio | 16:9 |
| Audio bitrate | 93227 bps |
| Audio channels | 2 |
| Audio Codec | aac |
| Audio Sample Rate | 48000 Hz |
| Total Bitrate | 899091 bps |
| Color Space | yuv420p |
| Container | mov,mp4,m4a,3gp,3g2,mj2 |
| Media Type | video/mp4 |
| Duration | 5092 s |
| Filename | DIVA-2016-742_hd.mp4 |
| File Size | 4.096 byte |
| Frame Rate | 25 |
| Video Bitrate | 799774 bps |
| Video Codec | h264 |
Media URL
Embed Code
Algorithmen II, Vorlesung, WS 2016/17
Episodes 1-26
of 26
