Hybrid Genetic Algorithm for Maximum Clique Problem
Harsh Bhasin, Naresh Kumar, Deepkiran Munjal · 2013
Maximum clique problem is one of the most important NP-hard problems which find its applications in numerous fields ranging from networking to the determination of the structure of a protein molecule. The present work carries forward one of our earlier works and examines the effect of variation of parameters for achieving optimization. The results obtained have been presented in the paper and are extremely encouraging. The premise used in the work is Genetic Algorithms, owing to their exceptional searching capabilities. The technique can be extended to many unsolvable problems and can be used in many applications from loop determination and circuit solving.