20: Algorithmen 2, Vorlesung, WS 2017/18, 15.01.2018

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

0 | 0:00:00 Starten 0:00:18 Anwendungen von DFS 0:05:13 Tiefensuchschema für G= (V,E) 0:09:29 Starke Zusammenhangskomponenten 0:12:53 SCCs generischer Algorithmus 0:20:12 Ziel: Effizienter Algorithmus 0:27:20 Invarianten 0:39:53 Invarianten von Gc 0:53:47 traverseNonTreeEdge(v,w) 0:56:47 Backtrack(u, v) 1:01:52 Beispiel 1:11:28 Zusammenfassung: SCC Berechnung 1:14:09 Mehr DFS-basierte Linearzeitalgorithmen

Episode metadata supplied by the publisher feed · Published Jan 15, 2018

Embed this episode

Attribution link and audio player

NOW PLAYING

20: Algorithmen 2, Vorlesung, WS 2017/18, 15.01.2018

0:00 1:15:57

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 15 minutes long.

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

This episode was published on January 15, 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.

URL copied to clipboard!