A Genetic Algorithm for the Maximal Clique Problem

  • Cristina Bazgan
  • Henri Luchian
Conference paper


The maximal clique problem (MaxClique) is known to be difficult (in terms of complexity) both in its exact and in the approximate form. Therefore, probabilistic algorithms for this problem are worthwhile to study. In this paper, we present an evolutionary (genetic) approach to solving the maximal clique problem (we are not directly concerned here with complexity). As opposed to previous work, our solution is inspired by a theoretical result [1] which improves the genetic algorithm. Experimental results for graphs with various properties are given; the convergence towards a good solution (in almost all of the runs, the global optimum) turns out to be quick.


Genetic Algorithm Approximation Algorithm Fitness Function Maximal Clique Probabilistic Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Croitoru, C., Radu,C.: “Quadratic programs on graphs”, The Scientific Annals of the “Al.I.Cuza” University, section la, Mathematics and Computer Science, Iasi, Romania, vol. xxxiv, 1988.Google Scholar
  2. [2]
    Michalewicz, Z.: “Genetic Algorithms+Data Structures = Evolutionary Programs”, Springer Verlag, 1992.Google Scholar
  3. [3]
    Murthy, A S., Parthasarathy, G., Sastry, V.U.K.: “Clique Finding — A Genetic Approach”, Proc. of the First IEEE ICEC Conference, Orlando, USA, 1994, pp. 18–21.Google Scholar
  4. [4]
    Back, T., Khuri, S.: “An Evolutionary Heuristic for the Maximal Independent Set Problem”, Proc. of the first IEEE ICEC Conference, Orlando, USA, 1994, pp. 531–535.Google Scholar
  5. [5]
    Garey, MR., Johnson, D.S.: Computers and Intractability Freeman, San Francisco, 1979.Google Scholar
  6. [6]
    Boppana, R., Halldorsson, M.M.: “ Approximating maximal independent set by excluding subgraphs”, BIT 32, 1992, pp. 180–196.MathSciNetMATHCrossRefGoogle Scholar
  7. [7]
    Hougardy, S., Promel, H.J., Steger, A.: “Probabilistically checkable proofs and their consequences for approximation algorithms”, research report, Forschungsinstitut fur Diskrete Mathematik, Univ. of Bonn, 1993.Google Scholar
  8. [8]
    Arora, S., Safa, S.: “ Approximating MaxClique is NP- Complete”, manuscript, 1992.Google Scholar
  9. [9]
    Kann, V.: “ On the Approximability of NP-Complete Optimisation Problems”, Phd Thesis, Royal Institute of Technology Stockolm, 1992.Google Scholar

Copyright information

© Springer-Verlag/Wien 1995

Authors and Affiliations

  • Cristina Bazgan
    • 1
  • Henri Luchian
    • 1
  1. 1.Faculty of Computer Science“Al.I.Cuza” University of IasiRomania

Personalised recommendations