ConceptTheory & Algos
Graph isomorphism problem (ISO)
ISO is the computational problem of testing whether two given undirected graphs are isomorphic, meaning they are identical except for a permutation of their nodes.
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
4The lectures that define it or assume it, and the concepts next to it.