ConceptTheory & Algos
Graph isomorphism
The computational problem of determining whether two finite graphs are isomorphic, known to be in NP.
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
2Each in their own terms, from the easiest level.
Ryan O'Donnell
Silvio Micali
A correspondence between the vertices of two graphs that preserves the edges.
Lectures that assume it
6Connections
16The lectures that define it or assume it, and the concepts next to it.