Matching (graph theory)

Related lectures (32)

Explains message passing in graphical models and the matching problem in graph theory.

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.

Explores the Ford-Fulkerson method for maximal flow and disjoint-set data structures.

Covers the Marriage Problem and the Gale Shapley Algorithm to find stable matches.

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

Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.

Explores online matching in evolving environments, addressing challenges and solutions for adapting algorithms to changing data.

Covers the Boolean Hidden Matching Problem and its applications to lower bounds.

Covers handling network data, types of graphs, centrality measures, and properties of real-world networks.

Explores bipartite graphs, independent sets, Shearer's Lemma, labeled graphs, and entropy analysis.

Explores the Szemerédi Regularity Lemma, e-regularity in bipartite graphs, supergraph structure, and induction techniques.

Page 2 of 2