Lecture 9: Network flow: Max-flow problem, min-cut problem, Ford-Fulkerson algorithm (3)

About this video

Editorial review · 85% confidence

Round-9 hunt: picked; channel-level screens (sellers/exam/re-upload/devotional/vendor) passed; strict per-title check + final strict pass; oEmbed verified.

A 51-minute video from Center on Frontiers of Computing Studies, PKU: “Lecture 9: Network flow: Max-flow problem, min-cut problem, Ford-Fulkerson algorithm (3)”.

Video by Center on Frontiers of Computing Studies, PKU, played through YouTube's embedded player.