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

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 w...

全面介紹

Saved in:
書目詳細資料
Main Authors: Busygin, Stanislav., Pasechnik, Dmitrii V.
其他作者: School of Physical and Mathematical Sciences
格式: Article
語言:English
出版: 2012
主題:
在線閱讀:https://hdl.handle.net/10356/80117
http://hdl.handle.net/10220/8272
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English

相似書籍