Sign inSign in

Sparsest cut problem

Finding the set of minimum conductance, which corresponds to the worst bottleneck for a random walk in a graph.
as Ryan O'Donnell defines itCarnegie Mellon University
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.

Conductance2Graph theory1

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 11:56Spectral Graph Theory: The Laplacian and the Spectral Theorem

Connections

3

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

Concept1

1 lecturer. 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.