Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique

  • Torsten Fahle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2461)


We consider a branch-and-bound algorithm for maximum clique problems. We introduce cost based filtering techniques for the socalled candidate set (i.e. a set of nodes that can possibly extend the clique in the current choice point).

Additionally, we present a taxonomy of upper bounds for maximum clique. Analytical results show that our cost based filtering is in a sense as tight as most of these well-known bounds for the maximum clique problem.

Experiments demonstrate that the combination of cost based filtering and vertex coloring bounds outperforms the old approach as well as approaches that only apply either of these techniques. Furthermore, the new algorithm is competitive with other recent algorithms for maximum clique.


maximum clique branch-and-bound constraint programming cost based filtering 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Atamtürk and G. L. Nemhauser and M.W.P. Savelsberg. Conflict Graphs in Integer Programming. European Journal of Operations Research, 121:40–55, 2000.zbMATHCrossRefGoogle Scholar
  2. [2]
    D. Brelaz. New methods to color the vertices of a graph. Communcations of the ACM, 22:251–256, 1979.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    M.R. Garey and D. S. Johnson. Computers and Intractability. W.H. Freeman & Co., 1979.Google Scholar
  4. [4]
    E. Balas, S. Ceria, G. Couruéjols and G. Pataki. Polyhedral Methods for the Maximum Clique Problem. in [15, p. 11–28].Google Scholar
  5. [5]
    E. Balas and C. S. Yu. Finding a Maximum Clique in an Arbitrary Graph. SIAM Journal Computing, 14(4):1054–1068, 1986.CrossRefMathSciNetGoogle Scholar
  6. [6]
    E. Balas and Xue. Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring. Algorithmica, 15:397–412, 1996.zbMATHMathSciNetGoogle Scholar
  7. [7]
    I.M. Bomze, M. Budinich, P.M. Pardalos, M. Pelillo. The Maximum Clique Problem. Handbook of Combinatorial Optimization, volume 4. Kluwer Academic Publishers, 1999.Google Scholar
  8. [8]
    A. Caprara and D. Pisinger and P. Toth. Exact Solutions on the Quadratic Knapsack Problem. Informs Journal on Computing, 11(2):125–137, 1999.zbMATHMathSciNetCrossRefGoogle Scholar
  9. [9]
    R. Carraghan and P.M. Pardalos. An exact algorithm for the maximum clique problem. Operations Research Letters 9:375–382, 1990.zbMATHCrossRefGoogle Scholar
  10. [10]
    T. Fahle. Cost Based Filtering vs. UpperBounds for Maximum Clique CP-AIOR’02 Workshop, Le Croisic/France, 2002.Google Scholar
  11. [11]
    T. Fahle, U. Junker, S.E. Karisch, N. Kohl, M. Sellmann, B. Vaaben. Constraint programming based column generation for crew assignment. Journal of Heuristics 8(1):59–81, 2002.zbMATHCrossRefGoogle Scholar
  12. [12]
    T. Fahle and M. Sellmann. Constraint Programming Based Column Generation with Knapsack Subproblems. Annals of Operations Reserach, Vol 114, 2003, to appear.Google Scholar
  13. [13]
    F. Focacci, A. Lodi, M. Milano. Cost-Based Domain Filtering. Proc. CP’99 LNCS 1713:189–203, 1999.Google Scholar
  14. [14]
    F. Focacci, A. Lodi, M. Milano. Cutting Planes in Constraint Programming: An Hybrid Approach. Proceedings of CP’00, Springer LNCF 1894:187–200, 2000.Google Scholar
  15. [15]
    D. S. Johnson and M.A. Trick. Cliques, Colorings and Satisfiability. 2nd DIMACS Implementation Challenge, 1993. American Mathematical Society, 1996.Google Scholar
  16. [16]
    U. Junker, S.E. Karisch, N. Kohl, B. Vaaben, T. Fahle, M. Sellmann. A Framework for Constraint programming based column generation. Proc. CP’99 LNCS 1713:261–274, 1999.Google Scholar
  17. [17]
    P.R. J. Östergård. A fast algorithm for the maximum clique problem. Discrete Applied Mathematics, to appear.Google Scholar
  18. [18]
    G. Ottosson and E. S. Thorsteinsson. Linear Relaxation and Reduced-Cost Based Propagation of Continuous Variable Subscripts. CP-AI-OR’00, Paderborn, 2000, submitted.Google Scholar
  19. [19]
    M. W.P. Savelsbergh. Preprocessing and probing techniques for mixed integer programming problems. ORSA Journal on Computing, 6:445–454, 1994.zbMATHMathSciNetGoogle Scholar
  20. [20]
    D.R. Wood. An algorithm for finding a maximum clique in a graph. Operations Research Letters, 21:211–217, 1997.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Torsten Fahle
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of PaderbornPaderbornGermany

Personalised recommendations