Lecture
Dijkstra's Algorithm: All-Pairs
Related lectures (79)
Graph Theory and Network Flows
Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.
Reformulating Problems: Tools and Intuition
Focuses on open problems and the importance of reformulating problems with better tools and intuition.
Max Flow Problem
Covers the max flow problem, weak duality, and the Ford-Fulkerson algorithm.
Linear Programming Basics
Covers the basics of linear programming and the simplex method, focusing on finding optimal solutions and handling degeneracy.
Linear Algebra: Efficiency and Complexity
Explores constraints, efficiency, and complexity in linear algebra, emphasizing convexity and worst-case complexity in algorithm analysis.
Convex Polyhedra and Linear Programs
Explores convex polyhedra, linear programs, and their optimization importance.
Interlacing Families and Ramanujan Graphs
Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.
Expander Graphs: Properties and Eigenvalues
Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.
Martingales: More Theory
Explores the theory of martingales, including conditional expectations, Chernoff bounds, and Azuma's inequality.
Poisson Paradigm: Qualitative / Quantitative
Covers the Poisson Paradigm, including the First/Second Moment Method and Martingales, discussing dependency graphs and Chernoff bounds.