Maximum Flow: Theory and Applications

Related lectures (28)

Page 1 of 3

Explores Bourgain's theorem on sparsest cut in graphs, emphasizing semimetrics and cut optimization.

Introduces the basics of graphs and networks, covering definitions, paths, trees, flows, circulation, and spanning trees.

Explores automorphism groups in trees and graphs, focusing on ends and types of automorphisms.

Explores automorphism groups of trees and graphs, including actions on trees and group homomorphisms.

Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.

Covers defining topological phases for photonic systems using unitary scattering matrices, transitioning from graphs to networks.

Covers graph properties, representations, and traversal algorithms using BFS and DFS.

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.

Explores the union and join operations on graphs, illustrating their definitions and properties.