1. DIMACS benchmark graphs.
http://iridia.ulb.ac.be/~fmascia/maximum_clique/DIMACS-benchmark
. Accessed 03 Mar 2018
2. Balasundaram, B., Butenko, S., Hicks, I.V.: Clique relaxations in social network analysis: the max k-plex problem. Oper. Res. 59(1), 133–142 (2011)
3. Batagelj, V., Zaversnik, M.: An O(m) algorithm for cores decomposition of networks. arXiv preprint cs/0310049 (2003)
4. Bhasin, H., Kumar, N., Munjal, D.: Hybrid genetic algorithm for maximum clique problem. Int. J. Appl. Innov. Eng. Manag. 2(4) (2013)
5. Bhasin, H., Mahajan, R.: Genetic algorithms based solution to maximum clique problem. Int. J. Comput. Sci. Eng. 4(8), 1443 (2012)