ConceptTheory & Algos
Forget vertex algorithm for 3-coloring
For a forget node, the entry is true if at least one extension of the coloring to the forgotten vertex has a true entry in the child bag's table.
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.