Ries, Bernard; Zenklusen, Rico - In: European Journal of Operational Research 210 (2011) 2, pp. 169-175
Given a graph G = (V, E), a satisfying bisection of G is a partition of the vertex set V into two sets V1, V2, such that |V1| = |V2|, and such that every vertex v [set membership, variant] V has at least as many neighbors in its own set as in the other set. The problem of deciding whether...