Ford-Fulkerson Method: Disjoint-set Data Structures

Related lectures (30)

Page 1 of 3

Explores the Ford-Fulkerson method, max-flow, applications of max-flow, and the disjoint-set data structure.

Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.

Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.

Discusses Union-Find data structures and Minimum Spanning Trees, covering algorithms and their applications in network design and optimization.

Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.

Explores the Max-flow Min-cut theorem, integral capacities, Ford-Fulkerson method, bipartite matching, and edge-disjoint paths.

Covers the concept of matroids, focusing on matroid intersection and the properties of subsets of a ground set.

Discusses election methods' desirable properties, multi-winner methods, district representation, gerrymandering, and the tyranny of the majority.

Explores the computation of mean field and effective field in message passing algorithms.

Covers exercises on the spin model, independent set, matching, and increasing functions.