ConceptTheory & Algos
Bipartite graph embedding for spectral bounds
Using bipartite graphs where vertices are mapped to +1 and -1 to achieve maximum separation of edge endpoints and maximize the quadratic form.
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.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.