Lecture
Shortest Path Problems: Bellman-Ford
Related lectures (32)
Counterfactuals: SEM and D-Separation
Explores counterfactuals in SEMs and D-Separation in graphical models.
Approximation Algorithms
Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Complex Systems: Critical Phenomena
Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.
Differential Forms on Manifolds
Introduces differential forms on manifolds, covering tangent bundles and intersection pairings.
Graph Sketching: Connected Components
Covers the concept of graph sketching with a focus on connected components.
Introduction to Shortest Path
Introduces the concept of shortest path, discussing weighted paths, Hamiltonian paths, and path optimization algorithms.
Shor's algorithm: factoring integers
Covers the basics of Shor's algorithm for factoring integers and the steps involved in the quantum algorithm.
Hamiltonian Homeomorphisms on Surfaces
Explores the action of Hamiltonian homeomorphisms on surfaces and discusses related mathematical concepts.
Graphical Definition: Level Sets and Domains
Covers the graphical definition of functions, focusing on level sets and domains.
Local Homeomorphisms and Coverings
Covers the concepts of local homeomorphisms and coverings in manifolds, emphasizing the conditions under which a map is considered a local homeomorphism or a covering.