Concept

Cut (graph theory)

Related lectures (28)

Algorithms: Union Find and Minimum Spanning Trees

Discusses Union-Find data structures and Minimum Spanning Trees, covering algorithms and their applications in network design and optimization.

Semidefinite Programming: Formulations and Applications

Explores Semidefinite Programming formulations, SDP relaxations, and optimization strategies with convergence guarantees.

Graph Theory and Network Flows

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

Max Flav-Min Cut in Directed Graphs

Covers the concept of maximum flow-minimum cut in directed graphs with capacity constraints.

Primal-dual Optimization II

Explores primal-dual optimization methods, focusing on Lagrangian approaches and various methods like penalty, augmented Lagrangian, and splitting techniques.

Maximum Flow: Theory and Applications

Explores maximum flow in graphs, covering Ford-Fulkerson algorithm, flow conservation, and minimum cut.

Max-Flow Min-Cut

Explores the Ford Fulkerson algorithm, Max-Flow Min-Cut theorem, Incidence matrix, and network optimization complexity.

Cutset Formulation: MST Problem

Explores the cutset formulation for the MST Problem and Gomory Cutting Planes method.