A note on the approximation of the max clique problem
- 11 October 1991
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 40 (1) , 1-5
- https://doi.org/10.1016/s0020-0190(05)80002-x
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976