Lecture

Max-flow and Disjoint Sets

Description

This lecture covers the Ford-Fulkerson method for finding the maximum flow in a network, including augmenting paths and bottleneck computation. It also explains the concept of min-cut and its relation to max-flow. The lecture then delves into applications of max-flow, such as bipartite matching and edge-disjoint paths. Additionally, it introduces the disjoint-set data structure, detailing operations like MAKE-SET and UNION, and their application in connected components. The lecture concludes with the weighted-union heuristic for union operations in disjoint sets, providing a theoretical analysis of its time complexity.

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 Mediaspace
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.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.