Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Max-flow Min-cut Theorem
Description
This lecture covers the Max-flow Min-cut theorem in flow networks, discussing the equivalence between maximum flow, no augmenting paths, and flow equal to minimum cut. It explains the upper bound for finding max-flow, the importance of integral capacities, and the Ford-Fulkerson method for bipartite matching. The lecture also explores edge-disjoint paths and their relation to max-flow and min-cut.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on MediaspaceOfficial source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.