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

 An Architecture to Achieve Anonymity and Traceability

 Anonymity has received increasing attention in the literature due to the users’ awareness of their privacy nowadays. Anonymity provides protection for users to enjoy network services without being traced. On the...

A Bayesian Classification Model for Fraud Detection over ATM Platforms

Abstract: The banking system relies greatly on the use of Automated Teller Machines, debit and credit cards as a vital element of its payment processing systems. The efficient functioning of payment processing systems al...

 Vehicle Security System with Theft Identification and Accident Notification

  The rapid development of electronics provides secured environment to the human. As a part of this ‘Vehicle Security System With Theft Identification And Accident Notification’ is designed to reduce the risk i...

A Review on Systematic Quality Software Designing and DevelopmentPractices

Abstract: Software Engineering process, technology and the results cover the definition of suitable models for the environment to ensure its quality.Any software development project is very important to create quality so...

Human Identification via Face Recognition: Comparative Study

Biometric recognition becomes an attractive issue of processing, and have a vast amount of real applications.According to wide spread of Internet and the new aspect of Internet of things, millions of human characteristic...

Download PDF file
  • EP ID EP105160
  • DOI 10.9790/0661-16366871
  • Views 110
  • Downloads 0

How To Cite

Savita, , Sudha (2014).  Next Generation Genetic Algorithm for Maximum Clique Problem. IOSR Journals (IOSR Journal of Computer Engineering), 16(3), 68-71. https://europub.co.uk./articles/-A-105160