Minimum Cut Problem

A classic optimization problem that involves finding the least-weighted cut in a graph, that is, the smallest set of edges that, if removed, would disconnect the graph.