ConceptTheory & Algos
Sparsest cut problem
Finding the set of minimum conductance, which corresponds to the worst bottleneck for a random walk in a graph.
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
1Ryan O'Donnell
Connections
3The lectures that define it or assume it, and the concepts next to it.