TR03-052 Authors: Stanislav Busygin, Dmitrii V. Pasechnik

Publication: 30th June 2003 18:16

Downloads: 1953

Keywords:

We show that for a graph G it is NP-hard to decide whether its independence number alpha(G) equals its clique partition number ~chi(G) even when some minimum clique partition of G is given. This implies that any alpha(G)-upper bound provably better than ~chi(G) is NP-hard to compute.

To establish this result we use a reduction of the Quasigroup Completion Problem (QCP, known to be NP-complete) to the maximum independent set problem. A QCP instance is satisfiable if and only if the independence number alpha(G) of the graph obtained within the reduction is equal to the number of holes h in the QCP instance. At the same time, the inequality ~chi(G)<=h always holds. Thus, QCP is satisfiable if and only if alpha(G)=~chi(G)=h. Computing the Lovasz number theta(G) we can detect QCP unsatisfiability at least when ~chi(G)<h. In the other cases QCP reduces to ~chi(G)-alpha(G)>0 gap recognition, with one minimum clique partition of G known.