Lecture 12: Matching
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.
Course Info
Instructors
As Taught In
Spring
2024
Level
Learning Resource Types
theaters
Lecture Videos
notes
Lecture Notes
Readings
assignment
Problem Sets
menu_book
Open Textbooks
