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

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

23 | 0:00:00 Starten 0:07:03 Flüsse und Ford Fulkerson 0:08:39 Max Flow - Min Cut 0:12:42 Dinitz: Distanz Label 0:14:37 Dinitz: Schichtgraph 0:15:45 Dinitz: Blockierender Fluss 0:17:21 Dinitz: Blockierender Fluss Operationen 0:20:36 Dinitz: Kosten pro Blockierender Fluss 0:24:14 Dinitz: Laufzeit 0:25:37 Dinitz: Kosten pro Phase, Unit Capacity Network 0:30:24 Maximum Cardinality Bipartite Matching 0:31:35 Preflow-Push Algorithms 0:34:00 Level Function 0:36:49 Procedure genericPreflowPush 1:21:53 Searching for Eligible Edges 1:23:50 Satz 11. Arbitrary Preflow Push finds a maximum flow in time O (n²m)

Episode metadata supplied by the publisher feed · Published Feb 5, 2018

Embed this episode

Attribution link and audio player

NOW PLAYING

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

0:00 1:26:58

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

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

This episode was published on February 5, 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!