Next Generation Genetic Algorithm for Maximum Clique Problem
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2014, Vol 16, Issue 3
Abstract
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.
Authors and Affiliations
Savita, , Sudha
Keywords
Related Articles
- EP ID EP105160
- DOI 10.9790/0661-16366871
- Views 102
- Downloads 0
Challenges and Issues of Cluster Based Security in MANET
Abstract: Mobile ad-hoc networks are a specific kind of wireless networks that can be quickly deployed without pre- existing infrastructures. Even though there are various studies on cluster based security in MANET but t...
Visual Cryptography Implementation with Key Sharing For Effective Phishing Detection Process
The advent of the internet, various online attacks has been increased and among them the most popular attack is phishing. Phishing is an attempt by an individual or a group to get personal, confidential information such...
A Survey on Word Sense Disambiguation
Ambiguity has been always interwoven with human language and its evolution. Some argue that ambiguity of the human languages is a byproduct of its complexity, with words that are frequently used in language of...
Design and Implementation of Agricultural Products Trading Application
Following the recent hike of the Smartphone use, applications with diverse purposes have been developed and provided to users. In case of agricultural products, seeing the actual products before buying them was conventio...
Modeling and Processing of Cloud Computing and It’s Performance Measurement
Abstract: Cloud computing is the growing technology of large scale distributed computing. It provides ondemand access to distributed resources, which are available in open environment on paid basis. Because all most all...