ConceptSystems & CS
Greedy operator ordering
A heuristic that iteratively finds the connected pair of nodes with the minimum intermediate result size and merges them.
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
1Andy Pavlo
Connections
5The lectures that define it or assume it, and the concepts next to it.