Publisher
Springer Science and Business Media LLC
Reference18 articles.
1. Garey MR, Johnson DS (2003) Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York
2. Papadimitriou CH (1994) Computational Complexity. Addison-Wesley Publishing Company Inc, Reading, MA
3. Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The Maximum Clique Problem, Handbook of Combinatorial Optimization, vol. 4. Kluwer Academic Publisher
4. Batsyn M, Goldengorin M, Maslov E, Pardalos PM (2014) Improvements to MCS algorithm for the maximum clique problem. J Comb Optim 27:397–416
5. Carraghan R, Pardalos PM (1990) An exact algorithm for the maximum clique problem. Oper Res Lett 9:375–382