Hybrid Genetic Algorithm for Maximum Clique Problem
作者： Deepkiran Munjal , Naresh Kumar , Harsh Bhasin
DOI:
关键词:
摘要: Maximum clique problem is one of the most important NP-hard problems which find its applications in numerous fields ranging from networking to determination structure a protein molecule. The present work carries forward our earlier works and examines effect variation parameters for achieving optimization. results obtained have been presented paper are extremely encouraging. premise used Genetic Algorithms, owing their exceptional searching capabilities. technique can be extended many unsolvable loop circuit solving.
ijaiem.org 参考文章(20)
Nishant Gupta, Harsh Bhasin, Randomized algorithm approach for solving PCP ,(2012)
Rohan Mahajan, Harsh Bhasin, Genetic Algorithms Based Solution To Maximum Clique Problem ,(2012)
章治郎 室, Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 情報処理. ,vol. 21, pp. 902- 903 ,(1980)
Etsuji Tomita, Hiroaki Nakanishi, Polynomial-time solvability of the maximum clique problem ECC'09 Proceedings of the 3rd international conference on European computing conference. pp. 203- 208 ,(2009)
Christian Trefftz, Roberto Cruz, Nancy Lopez, A parallelization of a heuristic for the maximum Clique problem Journal of Computing Sciences in Colleges. ,vol. 17, pp. 62- 70 ,(2001)
Kazuhisa Makino, Takeaki Uno, New Algorithms for Enumerating All Maximal Cliques Algorithm Theory - SWAT 2004. pp. 260- 272 ,(2004) , 10.1007/978-3-540-27810-8_23
James Cheng, Linhong Zhu, Yiping Ke, Shumo Chu, Fast algorithms for maximal clique enumeration with limited memory Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '12. pp. 1240- 1248 ,(2012) , 10.1145/2339530.2339724
Binay K. Bhattacharya, Damon Kaller, AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs Journal of Algorithms. ,vol. 25, pp. 336- 358 ,(1997) , 10.1006/JAGM.1997.0868
David R Wood, An algorithm for finding a maximum clique in a graph Operations Research Letters. ,vol. 21, pp. 211- 217 ,(1997) , 10.1016/S0167-6377(97)00054-0
Michael R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness ,(1979)