18: Algorithmen 2, Vorlesung und Übung, WS 2017/18, 19.12.2017

from Algorithmen 2, Vorlesung, WS17/18 · host Dr. rer. nat. Simon Gog

18 | 0:00:00 Starten 0:00:09 Fortgeschrittene Graphenalgorithmen 0:04:34 Allgemeine Definition 0:06:17 Kante relaxieren 0:07:11 Dijkstra's Agorithmus 0:08:40 Beispiel 0:09:00 Laufzeit 0:14:55 Lineare Laufzeit für dichte Graphen 0:26:30 Präfixminima einer Zufallsfolge 0:27:32 Monotone ganzzahlige Prioritätslisten 0:31:28 Bucket-Queue 0:34:22 Operation 0:35:17 Laufzeit Dijkstra mit Bucket-Queues 0:36:35 Übung8 0:36:41 Amortisierte Analyse 0:39:57 Legende 0:41:59 Fibonacci Heaps - Insert 0:44:09 Fibonacci Heaps - Delete Min 0:56:33 Fibonacci Heaps - Decrease Key 1:02:11 Fibonacci Heaps

Episode metadata supplied by the publisher feed · Published Dec 22, 2017

Embed this episode

Attribution link and audio player

NOW PLAYING

18: Algorithmen 2, Vorlesung und Übung, WS 2017/18, 19.12.2017

0:00 1:04:07

1×

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

Share this episode

Similar Episodes

No similar episodes found.

Similar Podcasts

Route 2 Adventure Peter Route 2 Adventure has interviews, reviews and research for the outdoor enthusiast as well as those in the RV world. Join Pete Robinson and his Airstream Meadowlark as he ventures into a life lived one rivet at a time.

Frequently Asked Questions

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

This episode is 1 hour and 4 minutes long.

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

This episode was published on December 22, 2017.

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.

URL copied to clipboard!