Next Generation Genetic Algorithm for Maximum Clique Problem

Abstract

Given a graph, in the maximum clique problem, one desires to find the largest number of vertices, any two of which are adjacent. A branch-and-bound algorithm for the maximum clique problem-which is computationally equivalent to the maximum independent (stable) set problem-is presented with the vertex order taken from a coloring of the vertices and with a new pruning strategy. The algorithm performs successfully for many instances when applied to random graphs and DIMACS benchmark graphs.

Detection of skin cancer- A genetic algorithm approach

“…Munya a Arasi et al [6] introduces a survey paper in which the classification methods such as K-NN, ANN & SVM are analysed.Proximal Support Vector Machine (PSVM) was adopted in this work. Savita ET a l [7] analyses the problem of finding Maximum Clique-Problem to find the solution largest subgraphs connected to one another. She developed a new technique to find the maxi-mum clique problem.…”

“…Soft Computing is an upcoming field that consists of important applications of self-computing which is image segmentation [2]. One of the soft computing advance to image segmentation is Genetic Algorithm based approach [7].Some researchers discussed that physical border detection is better when compared to computer-detected borders in order to detach the problems of feature extraction from the problems of automated lesion border detection. Due to the advancement of automated diagnostic system for detecting skin lesion, it is essential to develop automatic segmentation algorithms.…”