ConceptTheory & Algos
Perfect elimination ordering
An ordering of the vertices of a graph such that for each vertex, its neighbors that appear later in the ordering form a clique.
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
5The lectures that define it or assume it, and the concepts next to it.