| Input: | A graph G in this class with weight function on the edges and a real k. |
| Output: | True iff the vertices of G can be partitioned into two sets A,B such that the sum of weights of the edges in G with one endpoint in A and the other endpoint in B is at least k. |
3-perfect