Genetic Algorithms Based Solution To Maximum Clique Problem

作者： Rohan Mahajan , Harsh Bhasin

DOI:

关键词:

摘要: Maximum Clique Problem (MCP) is an NP Complete problem which finds its application in diverse fields. The work suggests the solution of above with help Genetic Algorithms (GAs). also takes into consideration, various attempts that have been made to solve this and other such problems. intend develop a generic methodology all problems via GAs thus exploring their ability find out optimal from amongst huge set solutions. has implemented analyzed satisfactory results.

暂无可下载资源，当前可以选择系统获取到有开放资源时通知我或者直接发起求助文献求助

参考文章(7)

F. Cazals, C. Karande, A note on the problem of reporting maximal cliques Theoretical Computer Science. ,vol. 407, pp. 564- 568 ,(2008) , 10.1016/J.TCS.2008.05.010

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)

Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihisa, An effective local search for the maximum clique problem Information Processing Letters. ,vol. 95, pp. 503- 511 ,(2005) , 10.1016/J.IPL.2005.05.010

Deniss Kumlander, Applying AI and incomplete solution principles to solve NP-hard problems in the real-time systems annual conference on computers. pp. 817- 821 ,(2006)

Thomas T. Cormen, Ronald L. Rivest, Charles E. Leiserson, Introduction to Algorithms ,(1990)

M.Komp, Adhi Harmoko S, Joseph Marie Jacquard, Eniac, Konrad Zuse, Introduction to Algorithms ,(2005)

Genetic Algorithms Based Solution To Maximum Clique Problem

来源期刊

我的账户

Genetic Algorithms Based Solution To Maximum Clique Problem

来源期刊

相似文章 10

我的账户