Modified Genetic Algorithm for Maximum Clique Problem

Abstract

Maximum clique problem is NP-hard problem which applies its application in determining the maximum connected sub graphs. Cliques are one of the basic concepts of graph theory and are used in many other mathematical problems and constructions on graphs. Clique corresponds to individual set in the graph. The approach used in obtaining maximum clique is Genetic Algorithm. Genetic Algorithms are a type of optimization algorithm which is based on the theory of natural selection for generating solutions of the problem. Genetic Algorithms are adaptive heuristic search algorithms for the survival of the fittest. The Genetic Algorithm is a probabilistic search algorithm that iteratively transforms a set of mathematical objects of fixed length binary string. The maximum clique problem calls for finding the maximum sized sub graphs in a particular graph. The intent is to develop a method to find the optimal solution from huge set of solutions.

Authors and Affiliations

Naresh Kumar , Deepkiran Munjal

Keywords

Related Articles

 Touchless Written English Characters Recognition using Neural Network

 Touchless written English character recognizer (TER), a new touchless approach to write and an intelligent approach to recognize English characters has been proposed in this paper. In TER, the inputs of English cha...

A New Approach For Image Cryptography Techniques

With the progress in data exchange by electronic system, the need of information security has become a necessity. Due to growth of multimedia applications, security becomes an important issue of communication and storage...

Designing and Executing The Program Logic Using Flowgramming

Generally software supports the execution of coding and complex instruction steps. There is an unbreakable relation between the program and coding back from the olden days and we are now, dependent mostly on complex codi...

 DAEMON Decisional Access in Emission Mechanism Of Networks

 The Decisional access method of mining is a process of retrieving data with some assumption decision from the data bases which are inter connected with databases Many of the organizations are providing design of th...

Effect of Couple Stress Fluid on Peristaltic Motion in a Uniform and Non-Uniform Annulus

Peristalsis is now well known to physiologists to be one of the major mechanisms for fluid transport in many biological systems. In particular, a mechanism may be involved in swallowing food through the esophagus, in uri...

Download PDF file
  • EP ID EP93786
  • DOI -
  • Views 129
  • Downloads 0

How To Cite

Naresh Kumar, Deepkiran Munjal (2013). Modified Genetic Algorithm for Maximum Clique Problem. International Journal of Computer & organization Trends(IJCOT), 3(4), 115-118. https://europub.co.uk/articles/-A-93786