ConceptTheory & Algos
3-Dimensional matching
A graph theory problem where given three disjoint sets and a set of allowable triples, you must find a subset of triples such that each element belongs to exactly one triple.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.