ConceptTheory & Algos
Stable marriage problem
The problem of finding a stable matching between two equally-sized sets of elements given preference lists for each element.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Tom Leighton
The problem of finding a stable, perfect matching between an equal number of boys and girls given their complete ranked preference lists.
Connections
8The lectures that define it or assume it, and the concepts next to it.