Skip to content
24: Algorithmen 2, Vorlesung, WS 2017/18, 30.01.2018 episode artwork

Feb 7, 2018 1 hr 28 min

24: Algorithmen 2, Vorlesung, WS 2017/18, 30.01.2018

from Algorithmen 2, Vorlesung, WS17/18 Hosted by Dr. rer. nat. Simon Gog

24 | 0:00:00 Starten 0:00:09 highest level preflow push 0:06:51 Example 0:13:50 Proof of Lemma 12 0:17:30 Claims 0:28:47 Heuristic Improvements 0:33:32 Experimental results 0:33:39 Timings: Random Graphs 0:36:16 Timings 0:36:40 Asymptotics 0:36:43 Zusammenfassung Flows und Matchings 0:49:53 Sortieren durch Mehrwege-Mischen 0:50:00 Das Sekundärspeichermodell 0:51:59 Externe Stapel 1:08:30 Externes (binäres) Mischen 1:08:56 Run Formation 1:10:11 Sortieren durch Externes Binäres Mischen 1:12:01 Zahlenbeispiel 1:14:11 Mehrwegmischen 1:20:53 Mehr zu externem Sortieren 1:21:31 Externe Prioritätslisten 1:21:57 Minimale Spannbäume 1:23:36 Externe MST-Berechnung 1:24:14 Beispiel, Sibeyn's algorithm 1:24:19 Mehr zu externen Algorithmen - Basic Toolbox

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

24: Algorithmen 2, Vorlesung, WS 2017/18, 30.01.2018

0:00 1:28:02

No transcript yet.

Requests help us decide what to transcribe next.

Frequently asked questions

How long is this episode of Algorithmen 2, Vorlesung, WS17/18?

This episode is 1 hour and 28 minutes long.

When was this Algorithmen 2, Vorlesung, WS17/18 episode published?

This episode was published on February 7, 2018.

Can I download this Algorithmen 2, Vorlesung, WS17/18 episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.