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

Performance Comparison of Eigen-faces vs. Fisher-faces for Face Recognition

Face recognition issue gained more interest recently due to its various applications and the demand of high security. In this paper two Face Recognition techniques, Eigen-faces commonly called Principal Component Analysi...

A Simulation And Analysis Of Secured S-DSR Protocol In Mobile Ad Hoc Networks

AMANET is as pecial kind of wireless network, which can be treated as a collection of mobile nodes co-existing with each other without the need of any fixed infrastructure. Because of the limited  physical security,...

Identification And Analysis Of Risks For Cloud Computing In IAAS, PAAS And SAAS

Now a days, cloud computing has been an emerging concept in the IT industry. Cloud computing is not a new technology but is a new way of using or delivering the resources. It also enhances the efficiency of computation b...

 Detecting and Alerting Tcp –Ip Packets againt TCP SYN attacks

 Transmission Control Protocol Synchronized ( TCP SYN) Flood has become a problem to the network management to maintain the network server from being attacked by the malicious attackers. Possibly one of the problems...

Fractal Image Compression Techniques

Image compression is an essential technology in multimedia and digital communication fields. Fractal image compression is a potential image compression scheme due to its potential high compression ratio, fast decompressi...

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