Using Constraint Programming to Solve the Maximum Clique Problem

  • Jean-Charles Régin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2833)

Abstract

This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a graph. A clique of a graph G=(X,E) is a subset V of X, such that every two nodes in V are joined by an edge of E. The maximum clique problem consists of finding ω(G) the largest cardinality of a clique. We propose two new upper bounds of ω(G) and a new strategy to guide the search for an optimal solution. The interest of our approach is emphasized by the results we obtain for the DIMACS Benchmarks. Seven instances are solved for the first time and two better lower bounds for problems remaining open are found. Moreover, we show that the CP method we propose gives good results and quickly.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Balas, E., Niehaus, W.: Finding large cliques in arbitrary graphs by bipartite matching. In: Johnson, D., Trick, M. (eds.) DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 29–52. American Mathematical Society, Providence (1996)Google Scholar
  2. 2.
    Berge, C.: Graphe et Hypergraphes. Dunod, Paris (1970)Google Scholar
  3. 3.
    Bomze, I., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. Handbook of Combinatorial Optimization  4 (1999)Google Scholar
  4. 4.
    Bron, C., Kerbosh, J.: Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM 16(9), 575–577 (1973)MATHCrossRefGoogle Scholar
  5. 5.
    Busygin, S.: A new trust region technique for the maximum weight clique problem. Submitted to Special Issue of Discrete Applied Mathematics: Combinatorial Optimization (2002)Google Scholar
  6. 6.
    Dimacs. Dimacs clique benchmark instances (1993), ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmarks/clique
  7. 7.
    Fahle, T.: Simple and fast: Improving a branch-and-bound algorithm for maximum clique. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 485–498. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
    Homer, S., Peinado, M.: Experiements with polynomial-time clique approximation algorithms on very large graphs. In: Johnson, D., Trick, M. (eds.) DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 147–168. American Mathematical Society, Providence (1996)Google Scholar
  9. 9.
    Östegard, P.: A fast algorithm for the maximum clique problem. Discrete Applied Mathematics (page to appear)Google Scholar
  10. 10.
    St-Louis, P., Gendron, B., Ferland, J.: A penalty-evaporation heuristic in a decomposition method for the maximum clique problem. In: Optimization Days, Montreal, Canada (2003)Google Scholar
  11. 11.
    Wood, D.: An algorithm for finding maximum clique in a graph. Operations Research Letters 21, 211–217 (1997)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Jean-Charles Régin
    • 1
  1. 1.ILOG Sophia AntipolisLes Taissounières HB2ValbonneFrance

Personalised recommendations