Sign inSign in

Graph isomorphism

The computational problem of determining whether two finite graphs are isomorphic, known to be in NP.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 3 definitions
Watch it explained

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.

Graph theory2Adjacency matrices1AM1coAM1Edge1NP1Undirected graph1Vertices1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 18:25Interactive Proofs: IP=PSPACE
  • Silvio Micali

    MIT · Undergraduate

    A correspondence between the vertices of two graphs that preserves the edges.
    • 11:37Proofs, Knowledge, and Computation: Zero-Knowledge Interactive Systems

Lectures that assume it

6

Connections

16

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.