Lecture
Max Flow Problem
Related lectures (47)
Expander Graphs: Properties and Eigenvalues
Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.
Optimization Algorithms
Covers optimization algorithms, convergence properties, and time complexity of sequences and functions.
Poisson Paradigm: Qualitative / Quantitative
Covers the Poisson Paradigm, including the First/Second Moment Method and Martingales, discussing dependency graphs and Chernoff bounds.
Pseudorandomness: Theory and Applications
Explores pseudorandomness theory, AI challenges, pseudo-random graphs, random walks, and matrix properties.
Linear Programming: Optimization and Constraints
Explores linear programming optimization with constraints, Dijkstra's algorithm, and LP formulations for finding feasible solutions.
Building Ramanujan Graphs
Explores the construction of Ramanujan graphs using polynomials and addresses challenges with the probabilistic method.
Hertz Theory: Real Area of Contact
Explores Hertz theory for contact problems and the Tabor measurement method.
Integer Program Formulation
Covers the process of formulating integer programs and improving solutions.
Taylor's approximation: Mean Value Theorem, l'Hopital rule, Examples
Covers the Mean Value Theorem, l'Hopital rule, Taylor's approximation, and more.
Probability and Statistics
Covers topics related to probability and statistics, including finding specific values and significant events.