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.
Source: Zachary Abel, Mathematics for Computer Science (MIT: OpenCourseWare). Licensed under CC BY-NC-SA 4.0.
Hypha Learn
Free university lectures and educational content, curated and republished from public sources.
4
see also ↓
-
IAP 2018: How to Speak1:03:42 Free
