ConceptTheory & Algos
Graph coloring problem
The task of assigning one of K colors to each node in a graph G such that no two adjacent nodes share the same color.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
6The lectures that define it or assume it, and the concepts next to it.