Author:
Hasan Mahmudul,Rafiqul Islam Md.,Mugdha Amrita Ghosh
Publisher
Springer Nature Singapore
Reference22 articles.
1. Gary, M.R., Johnson, D.S.: Computers and intractability: a guide tothe theory of NP-completeness (1979)
2. Solnon, C., Fenet, S.: A study of ACO capabilities for solving the maximum clique problem. J. Heurist. 12, 155–180 (2006)
3. Marchiori, E.: A simple heuristic based genetic algorithm for the maximum clique problem. In: Symposium on Applied Computing: Proceedings of the 1998 ACM Symposium on Applied Computing, vol. 27 (1998)
4. Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: a case study in local optimization. Local Search Comb. Optim. 1, 215–310 (1997)
5. Xu, X., Ma, J., Lei, J.: An improved ant colony optimization for the maximum clique problem. In: Third International Conference on Natural Computation (ICNC 2007) 2007 Aug 24, vol. 4, pp. 766–770. IEEE, New York