On NP-hardness of the clique partition—Independence number gap recognition and related problems-Reference-Cited by-同舟云学术

On NP-hardness of the clique partition—Independence number gap recognition and related problems

Published:2006-03 Issue:4 Volume:306 Page:460-463
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Busygin Stanislav,Pasechnik Dmitrii V.

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference15 articles.

1. D. Achlioptas, C. Gomes, H. Kautz, B. Selman, Generating satisfiable problem instances, in: Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-00), Austin, TX, 2000.

2. Algebraic Combinatorics I: Association Schemes;Bannai,1984

3. The complexity of completing partial latin squares;Colbourn;Discrete Appl. Math.,1984

4. Approximation of the stability number of a graph via copositive programming;de Klerk;SIAM J. Optim.,2001

5. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Monopolar graphs: Complexity of computing classical graph parameters;Discrete Applied Mathematics;2021-03

2. Minimum Guesswork With an Unreliable Oracle;IEEE Transactions on Information Theory;2020-12

3. On provably best construction heuristics for hard combinatorial optimization problems;Networks;2015-07-01

4. Chromatic Gallai identities operating on Lovász number;Mathematical Programming;2013-02-06

5. Maximum Clique, Maximum Independent Set, and Graph Coloring Problems;Wiley Encyclopedia of Operations Research and Management Science;2011-02-15