Given a graph, the problem is to divide the vertices in two sets, so that as many edges as possible go from one set to the other.
The goal is to separate the graph's nodes into two subsets, seeking to maximize the flow of connections between these subsets.