Unweighted Bipartite Matching

Related lectures (30)

Page 1 of 3

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

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

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

Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.

Covers linear programming duality and complementary slackness condition.

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

Covers the concept of graph sketching with a focus on connected components.

Explores Cheeger's inequalities for random walks on graphs and their implications.

Covers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.