A complete bipartite subgraph cover for G, i.e., a collection
of subsets of V, such that each
a complete bipartite subgraph of G and such that for each edge
there is some
that contains both u and v.
Cardinality of the complete bipartite subgraph cover, i.e., the number of
if MINIMUM CLIQUE PARTITION is
See MINIMUM CLIQUE PARTITION.
Equivalent to MINIMUM CLIQUE PARTITION under ratio-preserving reduction