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

 Analyzing and Surveying Trust In Cloud ComputingEnvironment

 Abstract: Cloud computing is the most discussed research area now-a-days which helps to provide elasticityand flexibility in using the computing resources and services to fulfill the requirement of current business...

Data Mining Techniques: Contemporary Amalgam System to Predict Diabetes.

Abstract: Diabetes is a never ending disease which affects many major organs of the human body, including heart, blood vessels, nerves, eyes and kidneys. The World Health Organization (WHO) estimates that nearly 200 mill...

 Reliable Multicast and Energy Conservation in MANET: A Survey

 Abstract: Mobile ad hoc networks are networks without any infrastructure and topology. They are self organized and battery powered networks with a large number of mobile nodes. Limited battery power is the most i...

 An Autonomous Self-Assessment Application to Track theEfficiency of a System in Runtime Environment

 Abstract: In this paper we are proposing a system which will intelligently determine the running time of aprocess according to the current processor state and the priority of the process. Moreover, given a pool ofp...

 A Comprehensive lossless modified compression in  medical application on DICOM CT images

 In current days, Digital Imaging and Communication in Medicine (DICOM) is widely used for viewing medical images from different modalities, distribution and storage. Image processing can be processed  by pho...

Download PDF file
  • EP ID EP105160
  • DOI 10.9790/0661-16366871
  • Views 116
  • 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