Given an undirected edge-weighted graph, G = (V,E), the maximum cut problem (Max-Cut) is to find a bipartition of the vertices that maximizes the weight of the edges crossing the partition. If the edge weights are non-negative, then this problem is equivalent to finding a maximum weight subset of the edges that forms a bipartite subgraph, i.e. the maximum bipartite subgraph problem. All results...