ConceptTheory & Algos
Graph conductance
A graph has large minimum conductance if every smallish set of vertices has a large number of edges touching it.
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.
Edge1Vertices1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.