ConceptTheory & Algos
Termination condition of TMA
The algorithm terminates when every girl has at most one boy, and marriages take place.
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.
Propose-and-reject algorithm1Stable marriage problem1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.