HEURISTIC ALGORITHM FOR CLIQUE PROBLEM
seminar projects crazy Active In SP Posts: 604 Joined: Dec 2008 
30012009, 11:43 PM
This paper provides a heuristic algorithm for an NPComplete problem. It is a result of a research on an NPComplete problem known as Clique problem. I have succeeded in developing an algorithm which will give the maximum size Clique, for a given graph G, as its output. This paper explains the algorithm, its time complexity, applications and its implementation in C. This is a research paper based on an interesting class of problems known as ?NPComplete? problems. No polynomialtime algorithm has yet been discovered for an NPComplete problem, nor has any one yet been able to prove a superpolynomialtime lower bound for any of them. This so called whether P ? NP question has been one of the deepest, most perplexing open research problems in theoretical Computer Science since it was posed in 1971. Use Search at http://topicideas.net/search.php wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion




Important Note..!
If you are not satisfied with above reply ,..PleaseASK HERE
So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this pagePopular Searches: c algorithm for hiring problem, heuristic algorithm in mesh network 2012, 2k38 problem, xbox halo network how to, mesh networking books, hiring problem algorithm, firefox problem, 