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
Network Flow Algorithms
Description
This lecture covers various network flow algorithms, including Max Flow, Min Cut, Uncapacitated Network Flow, Capacitated Network Flow, Negative Cost Cycle Algorithm, and Augmenting Path. The instructor explains the concepts through slides detailing the algorithms' steps and properties, such as spanning trees, incidence matrices, and unsaturated flows. The lecture progresses from basic definitions to more complex algorithms like the Bellman-Ford algorithm and Dijkstra's algorithm, emphasizing their applications in solving network flow problems.
Official 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.