07: Maximum Flows and Matchings, s-t Cuts, Ford Fulkerson Algorithm, Dinitz Algorithm
About this video
Editorial review · 85% confidenceNew channel KIT Lehre und Wissen: title sample judged 'pick' (Mostly full university lecture recordings across CS/math/engineering which clearly pass the bar, but mixed with program-); passed a second screen for sellers/exam-prep/re-uploads; 1 of 3 sampled transcripts showed teaching, 0 not; titles picked one by one, checked strictly; oEmbed verified.
A 84-minute video from KIT Lehre und Wissen: “07: Maximum Flows and Matchings, s-t Cuts, Ford Fulkerson Algorithm, Dinitz Algorithm”.
Video by KIT Lehre und Wissen, played through YouTube's embedded player.