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

Impact Analysis of Modulation Formats in 40 Gbit/s DWDM Systems

The development of digital optical communications systems at high flow rates (NX40Gbit/s) and wavelength division multiplexed (WDM) reveals new issues such as the need to compensate the chromatic dispersion at higher lev...

Security Issues  and Data Management In Cloud Computing

Cloud computing placed IT to higher and new limits by providing the market environment data storage and capacity with flexible and scalable and processing power to reach the demand and supply while reducing the capital e...

Table Detection and Extraction from Image Document

Tables make information easier to understand and perceive than regular text block. Now days, it  becomes popular structure for information representation. Format of tables differs and change according to need of rep...

Intrusion Detection System Using Fuzzy Inference System

Network security consists of the provisions and policies adopted by a network administrator to prevent and monitor unauthorized access or denial of a computer network and network accessible resources. Intrusions are the...

Identity Security Using Authentication and Authorization in Cloud Computing

The Growth of the Cloud Computing invention suggests attractive and innovative computing services through resource pooling and virtualization techniques. Cloud gives delivers different types of Computing Services to thei...

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