mirage

On NP-hardness of the clique partition : independence number gap recognition and related problems.

DSpace/Manakin Repository

 

Search DR-NTU


Advanced Search Subject Search

Browse

My Account

On NP-hardness of the clique partition : independence number gap recognition and related problems.

Show full item record

Title: On NP-hardness of the clique partition : independence number gap recognition and related problems.
Author: Busygin, Stanislav.; Pasechnik, Dmitrii V.
Copyright year: 2006
Abstract: We show that for a graph G it is NP-hard to decide whether its independence number α(G) equals its clique partition number ¯χ(G) even when some minimum clique partition of G is given. This implies that any α(G)-upper bound provably better than ¯χ (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 α(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 ¯χ (G)≤ h always holds. Thus, QCP is satisfiable if and only if α(G) = ¯χ (G) = h. Computing the Lovász number ϑ(G) we can detect QCP unsatisfiability at least when ¯χ (G) <h. In the other cases QCP reduces to ¯χ (G) − α(G) >0 gap recognition, with one minimum clique partition of G known.
Subject: DRNTU::Science::Mathematics::Discrete mathematics::Theory of computation.
Type: Journal Article
Series/ Journal Title: Discrete mathematics
School: School of Physical and Mathematical Sciences
Rights: © 2006 Elsevier. This is the author created version of a work that has been peer reviewed and accepted for publication by Discrete Mathematics, Elsevier. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: DOI [http://dx.doi.org/10.1016/j.disc.2006.01.004].
Version: Accepted version

Files in this item

Files Size Format View
11.On-NP-hardness.pdf 326.2Kb PDF View/Open
   

DOI Query

- Get published version (via Digital Object Identifier)
   

This item appears in the following Collection(s)

Show full item record

Statistics

Total views

All Items Views
On NP-hardness of the clique partition : independence number gap recognition and related problems. 273

Total downloads

All Bitstreams Views
11.On-NP-hardness.pdf 107

Top country downloads

Country Code Views
United States of America 65
China 8
Russian Federation 7
Singapore 4
Turkey 3

Top city downloads

city Views
Mountain View 46
Singapore 4
Beijing 2
Seattle 2
Birobidzhan 1

Downloads / month

  2014-10 2014-11 2014-12 total
11.On-NP-hardness.pdf 0 0 1 1