Name: Lecture 12: Matching
Uploaded: 2025-07-22T14:44:14Z
Duration: 1 h 21 min 44 s
Description: A matching in a graph G is a subgraph M of G in which every vertex has degree 1. In this lecture, we examine types of matching problems, such as maximum weight matching, stable matching, and matching in bipartite and non-bipartite graphs.

1:21:44

A matching in a graph G is a subgraph M of G in which every vertex has degree 1. In this lecture, we examine types of matching problems, such as maximum weight matching, stable matching, and matching in bipartite and non-bipartite graphs.