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 objective is to split the graph's nodes into two sets, with the aim of maximizing the connections between the two sets.