We aim to minimize the cut, which is defined to be the sum of the crossing edges between the two sets of nodes.
in other words, we want to split the sentences into two maximally dissimilar classes by choosing A and B to minimize: we need to ensure that the two partitions are not only maximally different from each other, but also that they are themselves homogeneous by accounting for intra-partition node similarity.