Concept
Cut (graph theory)
Related lectures (46)
Quantum Approximate Optimization Algorithm
Covers the Quantum Approximate Optimization Algorithm, physically inspired unitary coupled cluster ansatz, hardware-efficient ansatz, and variational quantum eigensolver.
Graph Sketching: Connected Components
Covers graph sketching and connected components in streaming models.
Semi-Definite Programming
Covers semi-definite programming and optimization over positive semidefinite cones.
Cheeger's Inequality
Explores Cheeger's inequality and its implications in graph theory.
Sparsest Cut: ARV Theorem
Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.
Clustering: K-means & LDA
Covers clustering using K-means and LDA, PCA, K-means properties, Fisher LDA, and spectral clustering.
Ford-Fulkerson Method
Introduces the Ford-Fulkerson Method to find the maximum flow in a network.
Ford-Fulkerson Method: Max Flow and Min Cut
Explores the Ford-Fulkerson method for finding max flow and min cut in a network.
Max-flow Min-cut Theorem
Explores the equivalence between maximum flow and minimum cut in network theory, demonstrating its applications through examples and edge-disjoint paths.
Sparsest Cut: Bourgain's Theorem
Explores Bourgain's theorem on sparsest cut in graphs, emphasizing semimetrics and cut optimization.