Graph Partition
Input description: A weighted graph G=(V,E) and integers j,k
Problem description: Is there a partition of the vertices into two subsets such that each subset has size at most j, and the weight of edges connecting the two subsets is at most k.