Rainbow matching

Related lectures (10)

Page 1 of 1

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

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

Explores linear programming duality, covering constraints, variables, solutions, and the relationship between primal and dual LP.

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

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

Covers recent advancements in the dimer model, emphasizing its applications in probability and conformal field theory.

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

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

Covers hypergraphs, complete hypergraphs, link prediction, and scoring methods in network data analysis.

Covers bipartite and n-partite graphs, including complete graph definitions and examples.