A note on the approximation of the max clique problem
Authors:
- P. CrescenziPCP. Crescenzi
- C. FioriniCFC. Fiorini
- R. SilvestriRSR. Silvestri
- 11 October 1991
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 40 (1) , 1-5
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976