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

Gradation of NGO’s Role in Rural Development: A Fuzzy Soft Set Theoretic Approach

 The non-governmental organizations (NGO) are recognized as important institutional actors that are expected to facilitate the participation of beneficiaries in the development programmes such as mobilising communit...

Content Filtering using Internet Proxy Servers

Content filtering has been around since the internet has been around. Content filtering is the process of removing certain content from the internet before it gets to the user that requested that page. There are many dif...

Implication of Cell Phone Usage on Study Patterns of Teens

Cell phone usage has become worldwide commodity for every person regardless of their ages. Over the years, teenagers within the age bracket of thirteen to nineteen are more vulnerable towards the use of the technology in...

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...

Download PDF file
  • EP ID EP93786
  • DOI -
  • Views 116
  • 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