OLHOpen Lecture Hall

Home / Lectures / Mathematics for Computer Science

Still from the lecture

Mathematics

Lecture 7: Matching Problems

Course: Mathematics for Computer Science
Instructor: Prof. Tom Leighton
Department: Electrical Engineering and Computer Science
Recorded: Fall 2010
Level: Undergraduate

▶ Watch the lecture

Free account required. The lecture opens at MIT OpenCourseWare.

About this lecture

Introduces the concept of matching. Discusses the mating algorithm, its fairness, and relation to practical applications.

← Lecture 6: Graph Theory and Coloring Lecture 8: Graph Theory II: Minimum Spanning Trees →

More in Mathematics

Still from the lecture “Lecture 1: The geometry of linear equations”

Lecture 1: The geometry of linear equations

Linear Algebra · Prof. Gilbert Strang

Still from the lecture “Lecture 2: Elimination with matrices”

Lecture 2: Elimination with matrices

Linear Algebra · Prof. Gilbert Strang

Still from the lecture “Lecture 3: Multiplication and inverse matrices”

Lecture 3: Multiplication and inverse matrices

Linear Algebra · Prof. Gilbert Strang