Lecture
Bellman-Ford Algorithm: Shortest Path Estimation
Related lectures (53)
Fixed Points in Graph Theory
Focuses on fixed points in graph theory and their implications in algorithms and analysis.
Graph Algorithms: Modeling and Traversal
Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.
Graph Algorithms II: Traversal and Paths
Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.
Properties of Trees: Nodes, Paths, and CyclesMOOC: Optimization: principles and algorithms - Linear optimization
Explores the properties of trees in graph theory, focusing on nodes, paths, cycles, and the characterization of trees in a directed graph.
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.
Statistical Analysis of Network Data
Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.
Shortest Paths: Negative Weights & Applications
Covers Minimum Spanning Trees, Kruskal's Algorithm, and Shortest Paths in directed graphs.
Max Flav-Min Cut in Directed Graphs
Covers the concept of maximum flow-minimum cut in directed graphs with capacity constraints.
Graph Theory and Network Flows
Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.
Belief Propagation
Explores Belief Propagation in graphical models, factor graphs, spin glass examples, Boltzmann distributions, and graph coloring properties.