Unweighted Bipartite Matching

Related lectures (54)

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

Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.

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

Explores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.

Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.

Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.

Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.

Covers the Leighton-Rao algorithm for finding the sparsest cut in a graph, focusing on its steps and theoretical foundations.

Explores pseudorandomness and the Expander Mixing Lemma in the context of d-regular graphs.

Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.

Explores the Bellman Ford algorithm for finding the shortest path in graphs with negative edge weights.

Explores Cheeger's inequality and its implications in graph theory.

Explores integrating brain connectivity to decode and interpret brain activity using graph signal processing and spectral residual networks.

Explores isogenic graphs, spectral properties, and mathematical applications in modular forms and cryptography.

Explores the construction of Ramanujan graphs using polynomials and addresses challenges with the probabilistic method.

Explores fundamental graph theory concepts, Erdős' results, Chromatic Lemma, and Union Bound theorem in graph theory.

Covers Linearity of Expectation, Markov's inequality, random variables, and transitive tournaments.

Presents the position space approach to banana Feynman diagrams and their differential equations.

Covers differentiable functions, extreme points, and the Lagrange multiplier method for optimization.

Explores network flows, simplex method, linear programming, tree solutions, and dual solutions in optimization problems.

Page 2 of 3