Concept
Maximum flow problem
Related lectures (46)
Stein Algorithm: Polynomial Identity Testing
Explores the Stein algorithm for polynomial identity testing and the minimization of a cut problem.
Lagrangian Duality: Optimization Tutorial
Covers Lagrangian duality in optimization, focusing on the minimum bin path problem and path time optimization.
Graph Sketching: Connected Components
Covers graph sketching and connected components in streaming models.
Sparsest Cut: Bourgain's Theorem
Explores Bourgain's theorem on sparsest cut in graphs, emphasizing semimetrics and cut optimization.
Flow Networks: Ford-Fulkerson Method
Explores flow networks, flows, and the Ford-Fulkerson Method for finding maximum flow in a network.
Max-Flow Problem: Ford-Fulkerson Algorithm
Explores the Ford-Fulkerson algorithm for solving the Max-Flow problem and its applications in network flow optimization.
Max-flow Min-cut Theorem
Explores the Max-flow Min-cut theorem, integral capacities, Ford-Fulkerson method, bipartite matching, and edge-disjoint paths.
Graph Mining: Modularity and Community Detection
Explores community detection in graphs using modularity and edge betweenness.
Graph Algorithms: DFS, Topological Sort, SCC
Explores DFS, Topological Sort, SCC in graphs, and introduces Flow Networks with practical examples.
Shortest Path in Directed Graphs
Covers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.