Skip to main content
SpringerLink
Log in

The maximum clique problem

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this paper we present a survey of results concerning algorithms, complexity, and applications of the maximum clique problem. We discuss enumerative and exact algorithms, heuristics, and a variety of other proposed methods. An up to date bibliography on the maximum clique and related problems is also provided.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Aharoni, P. Erdös, and N. Linial (1988), Optima of Dual Integer Linear Programs,Combinatorica 8 (1), 13–20.

    Google Scholar 

  2. E. A. Akkoyunlu (1973), The Enumeration of Maximal Cliques of Large Graphs,SIAM Journal on Computing 2, 1–6.

    Google Scholar 

  3. M. O. Albertson and J. P. Hutchinson (1978), On the Independence Ratio of a Graph,J. Graph Theory 2, 1–8.

    Google Scholar 

  4. N. Alon, L. Babai, and A. Itai (1986), A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem,J. Algorithms 7, 567–583.

    Google Scholar 

  5. A. T. Amin and S. L. Hakimi (1972), Upper Bounds on the Order of a Clique of a Graph,SIAM J. of Appl. Math. 22 (4), 569–573.

    Google Scholar 

  6. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy (1992), On the Intractability of Approximation Problems, Preliminary Draft, University of Rochester, NY.

    Google Scholar 

  7. S. Arora and S. Safra (1992), Approximating the Maximum Clique isNP-Complete, Preliminary Draft, University of Rochester, NY.

    Google Scholar 

  8. J. G. Auguston and J. Minker (1970), An Analysis of Some Graph Theoretical Cluster Techniques,J. Assoc. Comput. Mach. 17, 571–588.

    Google Scholar 

  9. G. Ausiello, A. D'Atr, and M. Protasi (1980), Structure Preserving Reductions among Convex Optimization Problems,J. Comput. and Syst. Sci. 21, 136–153.

    Google Scholar 

  10. G. Avondo-Bodeno (1962),Economic Applications of the Theory of Graphs, Gordon and Breach, Science Publishers, New York.

    Google Scholar 

  11. S. M. Baas, M. C. Bonvanie, and A. J. Verschoor (1988) A Relaxation Method for the Set Packing Problem Using Polyhedron Characteristic, Technical Report 699, University of Twente, Netherlands.

    Google Scholar 

  12. L. Babel (1991), Finding Maximum Cliques in Arbitrary and in Special Graphs,Computing 46, 321–341.

    Google Scholar 

  13. L. Babel and G. Tinhofer (1990), A Branch and Bound Algorithm for the Maximum Clique Problem,ZOR-Methods and Models of Operations Research,34, 207–217.

    Google Scholar 

  14. E. Balas (1986), A Fast Algorithm for Finding an Edge-Maximal Subgraph with a TR-Formative Coloring,Discr. Appl. Math. 15, 123–134.

    Google Scholar 

  15. E. Balas, V. Chvátal, and J. Nešetril (1987), On the Maximum Weight Clique Problem,Math. of Operations Research 12 (3), 522–535.

    Google Scholar 

  16. E. Balas and H. Samuelsson (1977), A Node Covering Algorithm,Naval Research Logistics Quarterly 24, 213–233.

    Google Scholar 

  17. E. Balas and P. Toth (1985), Branch and Bound Methods, in: Lawler, Lenstra, Rinnooy Kan, and Shmoys (eds.),The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley: 361–403.

  18. E. Balas and J. Xue (1991), Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs,SIAM J. Comput. 2, 209–221; “Addendum,”SIAM J. Comput. 21: 1000, 1992.

    Google Scholar 

  19. E. Balas and J. Xue (1993), Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring, Management Science Research Report 590, GSIA, Carnegie Mellon University, April 1993.

  20. E. Balas and C. S. Yu (1986), Finding a Maximum Clique in an Arbitrary Graph,SIAM J. Computing 14 (4), 1054–1068.

    Google Scholar 

  21. E. Balas and C. S. Yu (1989), On Graphs with Polynomially Solvable Maximum-Weight Clique Problem,Networks,19, 247–253.

    Google Scholar 

  22. D. H. Ballard and M. Brown, (1982),Computer Vision, Prentice-Hall, Englewood Cliffs, N.J.

    Google Scholar 

  23. R. Bar-Yehuda and S. Even (1985), A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem,Annals of Discrete Mathemtics 25, 27–46.

    Google Scholar 

  24. F. Barahona, A. Weintraub, and R. Epstein (1992), Habitat Dispersion in Forest Planning and the Stable Set Problem,Operations Research 40, Supp. 1: S14-S21.

    Google Scholar 

  25. A. R. Bednarek and O. E. Taulbee, (1966), On Maximal Chains,Roum. Math. Pres et Appl. 11, 23–25.

    Google Scholar 

  26. L. W. Beineke (1969), A Survey of Packings and Coverings in Graphs in the Many Facets of Graph Theory, G. Chartrand and S. Kapoor (eds.), Springer-Verlag: 45–53.

  27. C. Berge and V. Chvátal (eds.), (1984), Topics on Perfect Graphs,Annals of Discrete Mathematics,21.

  28. P. Berman and A. Pelc (1990), Distribution Fault Diagnosis for Multiprocessor Systems,Proc. of the 20th Annual Intern. Symp. on Fault-Tolerant Computing (Newcastle, UK): 340–346.

  29. P. Berman and G. Schnitger (1989), On the Complexity of Approximating the Independent Set Problem, InProceedings of the 1989 Symposium on Theoret. Aspects of Comp. Sci., Springer-Verlag, Lecture Notes in Computer Sciences 349: 256–268.

  30. A. Billionnet (1981), An Upper Bound on the Size of the Largest Cliques in a Graph,J. Graph Theory,5, 165–169.

    Google Scholar 

  31. B. Bollobás and P. Erdös (1976), Cliques in Random Graphs,Math. Proc. Cambridge Philos. Soc. 80, 419–427.

    Google Scholar 

  32. B. Bollobás (1985),Random Graphs, Academic Press, NY.

    Google Scholar 

  33. R. E. Bonner (1964), On Some Clustering Techniques,IBM J. Res. Develop. 8 (1), 22–32.

    Google Scholar 

  34. R. Boppana and M. M. Halldórsson (1990), Approximating Maximum Independent Sets by Excluding Subgraphs,Proc. SWAT 90, Lecture Notes in Computer Sciences: 11–25, Springer.

  35. M. Boulala and J. P. Uhry (1979), Polytope des Independants dans un Graphe Serie-Paralle,Discrete Mathematics,27, 225–243.

    Google Scholar 

  36. D. Brelaz (1979), New Methods to Color the Vertices of a Graph,Comm. of ACM 22 (4), 251–256.

    Google Scholar 

  37. C. Bron and J. Kerbosch (1973), Algorithm 457: Finding All Cliques of an Undirected Graph,Comm. of ACM,16, 575–577.

    Google Scholar 

  38. A. E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith, (1990), A New Table of Constant Weight Codes,J. IEEE Trans. Information Theory 36, 1334–1380.

    Google Scholar 

  39. M. A. Buckingham (1981), Efficient Stable Set and Clique Finding Algorithms for Overlap Graphs, Technical Report, Dept. Computer Science, New York Univ.

  40. M. Burlet and J. Fonlupt (1984), Polynomial Algorithm to Recognize a Meyniel Graph, in W. R. Pulleyblank (ed.),Progress in Combinatorial Optimization, Academic Press, Toronto: 69–99.

    Google Scholar 

  41. J. E. Burns (1989), The Maximum Independent Set Problem for Cubic Planar Graph,Networks 9, 373–378.

    Google Scholar 

  42. L. Butz, P. L. Hammer, and D. Hausmann (1975), Reduction Methods for the Vertex Packing Problem, Technical Report 7540, Univ. of Bonn, Institut für Ekonometric und Operations Research.

  43. R. Carraghan and P. M. Pardalos (1990), An Exact Algorithm for the Maximum Clique Problem,Operations Research Letters 9, 375–382.

    Google Scholar 

  44. R. Carraghan and P. M. Pardalos (1990), A Parallel Algorithm for the Maximum Weight Clique Problem, Technical Report CS-90-40, Dept. of Computer Science, Penn. State Univ.

  45. R. C. Chang and H. S. Lee (1992), Finding a Maximum Set of Independent Chords in a Circle,Info. Proc. Letters 41, 99–102.

    Google Scholar 

  46. N. Chiba and T. Nishizeki (1985), Arboricity and Subgraph Listing Algorithms,SIAM J. Comput. 14, 210–223.

    Google Scholar 

  47. N. Chiba, T. Nishizeki, and N. Saito (1982), An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs,SIAM. J. Comput. 11 (4), 663–675.

    Google Scholar 

  48. N. Chiba, T. Nishizeki, and N. Saito (1983), An Algorithm for Finding a Large Independent Set in Planar Graphs,Networks,13, 247–252.

    Google Scholar 

  49. E. Choukhmane and J. Franco (1986), An Approximation Algorithm for the Maximum Independent Set Problem in Cubic Planar Graphs,Networks 16, 349–356.

    Google Scholar 

  50. N. Christofides (1975),Graph theory, An algorithmic Approach, Academic Press.

  51. M. Chrobak and J. Naor (1991), An Efficient Parallel Algorithm for Computing a Large Independent Set in a Planar Graph,Algorithmica,6, 801–815.

    Google Scholar 

  52. V. Chvátal (1975), On Certain Polytopes Associated with Graphs,J. of Combin. Theory B 18, 138–154.

    Google Scholar 

  53. V. Chvátal (1977), Determining the Stability Number of a Graph,SIAM J. on Comput. 6, 643–662.

    Google Scholar 

  54. V. Chvátal (1979), A Greedy Heuristic for the Set-Covering Problem,Math. Oper. Res. 4, 233–243.

    Google Scholar 

  55. V. Chvátal (1985), Perfectly Orderable Graphs,Annals of Discrete Math. 21, 63–65.

    Google Scholar 

  56. K. Corradi and S. Szabo (1990), A Combinatorial Approach for Keller's Conjecture,Periodica Mathematica Hungarica 21 (2), 95–100.

    Google Scholar 

  57. P. Crescenzi, C. Fiorini, and R. Silvestri (1991), A Note on the Approximation of the MAX CLIQUE Problem,Infor. Proces. Letters 40, 1–5.

    Google Scholar 

  58. E. Dahlhaus and M. Karpinski (1987), A Fast Parallel Algorithms for Computing All Maximal Cliques in a Graph and the Related Problems, Technical Report 8516-CS, Institut für Informatik, Universität Bonn, Römerstrasse 164, 5300 Bonn 1.

    Google Scholar 

  59. V. Degot and J. M. Hualde (1975), De l'utilisation de la Notion de Clique en Matière de Typologie des Populations, R.A.I.R.O., 1.

  60. N. Deo (1974),Graph Theory with Applications to Engineering and Computer Science, Prentice-Hall, Engelwood Cliffs, NJ.

    Google Scholar 

  61. J. F. Desler and S. L. Hakimi (1970), On Finding a Maximum Internally Stable Set on a Graph,Proc. of Fourth Annual Princeton Conference on Information Sciences and Systems 4, 459–462, Princeton, NJ.

    Google Scholar 

  62. G. A. Dirac (1952), A Property of 4-Chromatic Graphs and Some Remarks on Critical Graphs,J. London Math. Society 27, 85–92.

    Google Scholar 

  63. G. A. Dirac (1961), On Rigid Circuit Graphs,Abh. Math. Sem., Univ. Hamburg,25, 71–76.

    Google Scholar 

  64. P. Doreian (1969), A Note on the Detection of Cliques in Valued Graphs,Sociometry 32, 237–242.

    Google Scholar 

  65. C. Ebenegger, P. L. Hammer, and D. de Werra, (1984), Pseudo-Boolean Functions and Stability of Graphs,Annals of Discrete Mathematics 19, 83–98.

    Google Scholar 

  66. J. Edmonds (1962), Covers and Packings in a Family of Sets,Am. Math. Soc. Bull. 68, 494–497.

    Google Scholar 

  67. C. S. Edwards and C. H. Elphick (1983), Lower Bounds for the Clique and the Chromatic Numbers of a Graph,Disc. Math. 5, 51–64.

    Google Scholar 

  68. P. Erdös and M. Erne (1986), Clique Numbers of Graphs,Discrete Mathematics 59, 235–242.

    Google Scholar 

  69. F. Escalante (1973), Über Iterierte Clique-Graphen,Abh. Math. Sem. Univ. Hamburg 39, 59–68.

    Google Scholar 

  70. S. Fajtlowicz (1978), On the Size of Independent Sets in Graphs,Proc. 9th S.E. Conf. on Combin., Graph Theory and Comput.: 269–274, Boca Raton.

  71. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy (1991), Approximating the Maximum Clique is AlmostNP-Complete,Proc. 32nd IEEE Symp. on Foundations of Computer Science: 2–12.

  72. T. A. Feo, M. G. C. Resende, and S. H. Smith (1994), A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set,Operations Research, to appear.

  73. M. L. Fisher and L. A. Wolsey (1982), On the Greedy Heuristic for Continuous Covering and Packing Problems,SIAM J. Alg. Disc. Meth. 3, 584–591.

    Google Scholar 

  74. A. Frank (1976), Some Polynomial Algorithms for Certain Graphs and Hypergraphs,Proc. 5th British Combin. Conf: 211–226.

  75. C. Friden, A. Hertz, and D. de Werra (1989), Stabulus: A Technique for Finding Stable Sets in Large Graphs with Tabu Search,Computing 42, 35–4.

    Google Scholar 

  76. C. Friden, A. Hertz, and M. de Werra (1990), TABARIS: An Exact Algorithm Based on Tabu Search For Finding a Maximum Independent Set in a Graph,Computers and Operations Research 17 (5), 437–445.

    Google Scholar 

  77. A. Frieze (1990), On the Independence Number of Random Graphs,Discrete Math. 81, 171–175.

    Google Scholar 

  78. Z. Füredi (1987), The Number of Maximal Independent Sets in Connected Graphs,J. Graph Theory 11, 463–470.

    Google Scholar 

  79. M. Garey and D. Johnson (1979),Computers and Intractability, A Guide to The Theory of NP-Completeness, Freeman, San Francisco.

    Google Scholar 

  80. F. Gavrill (1992), Algorithms for Minimum Colouring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph,SIAM J. Comput. 1, 180–187.

    Google Scholar 

  81. F. Gavril (1973), Algorithms for a Maximum Clique and a Maximum Independent Set of a Circle Graph,Networks 3, 261–273.

    Google Scholar 

  82. F. Gavril (1974), Algorithms on Circular Arc Graphs,Networks 4, 357–369.

    Google Scholar 

  83. M. Gendreau, J. C. Picard, and L. Zubieta (1988), An Efficient Implicit Enumeration Algorithm for the Maximum Clique Problem, A. Kurzhanskiet al. (eds),Lecture Notes in Economics and Mathematical Systems,304, 70–91, Springer-Verlag.

  84. A. Gendreau, L. Salvail, and P. Soriano (1989), Solving the Maximum Clique Problem Using a Tabu Search Approach, Technical Report 675, Center for Research on Transportation, University of Montreal, Montreal, Canada.

    Google Scholar 

  85. L. Gerhards and W. Lindenberg (1979). Clique Detection for Nondirected Graphs: Two New Algorithms,Computing 21, 295–322.

    Google Scholar 

  86. A. M. H. Gerards and A. Schrijver (1986), Matrices with the Edmonds-Johnson Property,Combinatorica 6, 403–417.

    Google Scholar 

  87. L. E. Gibbons, D. W. Hearn, and P. M. Pardalos (1993), A Continuous Optimization Approach for Finding Large Cliques in Dense Graphs, Working Paper, University of Florida.

  88. R. Giles and L. R. Trotter (1981), On Stable Set Polyhedra forK 1,3 Free Graphs,J. Combin. Theory B 31, 313–326.

    Google Scholar 

  89. M. Goldberg and T. Spencer (1989), A New Parallel Algorithm for the Maximal Independent Set Problem,SIAM J. Comput. 18 (2), 419–427.

    Google Scholar 

  90. M. Goldberg and T. Spencer (1989), Constructing a Maximal Independent Set in Parallel,SIAM J. Disc. Math. 2 (3), 322–328.

    Google Scholar 

  91. M. Goldman and J. Hastad (1992), A Simple Lower Bound for Monotone Clique Using a Communication Game,Info. Proc. Letters 41, 221–226.

    Google Scholar 

  92. M. C. Golumbic (1980),Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York.

    Google Scholar 

  93. M. C. Golumbic and P. L. Hammer (1988), Stability in Circular-Arc-Graphs,J. Algorithm 9, 314–320.

    Google Scholar 

  94. J. R. Giggs (1983), Lower Bounds on the Independence Number in Terms of the Degrees,J. Combin. Theory B 34, 22–39.

    Google Scholar 

  95. J. R. Griggs, M. Grinstead, and D. Guichard (1988), The Maximum Number of Maximal Independent Sets in a Connected Graph,Discrete Mathematics 68, 211–220.

    Google Scholar 

  96. G. R. Grimmett and W. R. Pulleyblank (1985). Random Near-Regular Graphs and the Node Packing Problem,Operations Research Letters 4, 169–174.

    Google Scholar 

  97. M. Grötschel, L. Lovász, and A. Schrijver (1987), The Ellipsoid Method and Its Consequences in Combinatorial Optimization,Combinatorica 1, 169–197.

    Google Scholar 

  98. M. Grötschel, L. Lovász, and A. Schrijver (1986), Relaxations of Vertex Packing,J. Combin. Theory B 40, 330–343.

    Google Scholar 

  99. M. Grötschel, L. Lovász, and A. Schrijver (1988),Geometric Algorithms and Combinatorial Optimization, Springer-Verlag.

  100. M. Grötschel, L. Lovász, and A. Schrijver (1989), Polynomial Algorithms for Perfect Graphs,Annals of Discrete Mathematics 21, 325–356.

    Google Scholar 

  101. U. I. Gupta, D. T. Lee, and J. Y. T. Leung (1982), Efficient Algorithms for Interval Graphs and Circular-Arc Graphs,Networks 12, 459–467.

    Google Scholar 

  102. Y. Gurevich and S. Shelah (1984), Expected Computation Time for Hamiltonian Path Problem and Clique Problem, Technical Report, Computing Research Laboratory, The Univ. of Michigan.

  103. W. W. Hager, P. M. Pardalos, I. M. Roussos, and H. D. Sahinoglou (1991), Active constraints, Indefinite Quadratic Programming and Test Problems,Journal of Optimization Theory and Applications,68 (3), 499–511.

    Google Scholar 

  104. S. L. Hakimi and H. Frank (1969), Maximum Internally Stable Sets of a Graph,J. of Math. Anal, and Appl. 25, 296–308.

    Google Scholar 

  105. P. L. Hammer, P. Hansen, and B. Simeone (1980). Vertices Belonging to All or to No Maximum Stable Sets of a Graph, FUCAM Research Report.

  106. P. Hansen (1975), Degrés et Nombre de Stabilité d'un Graph,Cahiers du CERP 17, 213–220.

    Google Scholar 

  107. P. Hansen (1979), Upper Bounds for the Stability Number of a Graph,Revue Roumaine de Math. Pures et Appliquees 24, 1195–1199.

    Google Scholar 

  108. P. Hansen (1980), Bornes et Algorithmes Pour les Stable d'un Graphe, InRegards sur la Theory des Graph (eds. P. Hansen and D. de Werra), Presses Polytechniques Romandes.

  109. P. Hansen and N. Mladenovic (1992), Two Algorithms for Maximum Cliques in Dense Graphs, Technical Report, Ecole des Hautes Etudes Commerciales, Montreal, Canada.

    Google Scholar 

  110. F. Harary and I. C. Ross (1957). A Procedure for Clique Detection Using the Group Matrix,Sociometry 20, 205–215.

    Google Scholar 

  111. J. Hasselberg, P. M. Pardalos, and G. Vairaktarakis (1993), Test Case Generators and Computational Results for the Maximum Clique Problem,Journal of Global Optimization 3, 463–482.

    Google Scholar 

  112. R. B. Hayward (1985), Weakly Triangulated Graphs,J. of Combin. Theory B 39, 200–209.

    Google Scholar 

  113. R. Hayward, C. T. Hoang, and F. Maffray (1989), Optimizing Weakly Triangulated Graphs,Graphs and Combinatorics 5, 339–349. See alsoErratum 6, 33–35, 1990.

    Google Scholar 

  114. B. Hedman (1985), The Maximum Number of Cliques in Dense Graphs,Discrete Mathematics 54, 161–166.

    Google Scholar 

  115. I. Heller (1957), On Linear Systems with Integral Valued Solutions,Pacific J. of Math. 7, 1351–1364.

    Google Scholar 

  116. C. W. Ho and R. C. T. Lee (1988), Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring of Chordal Graphs,Inform. Process. Letter 28, 301–309.

    Google Scholar 

  117. C. Hoded (1988), Hard Graphs for the Maximum Clique Problem,Discrete Mathematics,72, 175–179.

    Google Scholar 

  118. D. J. Houck (1974), On the Vertex Packing Problem, Ph.D. dissertation, The Johns Hopkins University, Baltimore.

    Google Scholar 

  119. D. J. Houck and R. R. Vemuganti (1977). An Algorithm for the Vertex Packing Problem,Operations Research 25, 773–787.

    Google Scholar 

  120. W. L. Hsu (1985), Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs,SIAM J. Comput.,14 (1) 224–231.

    Google Scholar 

  121. W. L. Hsu (1988), The Coloring and Maximum Independent Set Problems on Planar Perfect Graphs,J. ACM 35 (3), 535–563.

    Google Scholar 

  122. W. Hsu, Y. Ikura, and G. L. Nemhauser (1981), A Polynomial Algorithm for Maximum Weighted Vertex Packings on Graphs without Long Odd Cycles,Math. Programming 20, 225–232.

    Google Scholar 

  123. C. H. Hubbell (1965), An Input-Output Approach to Clique Identification,Sociometry 28, 377–399.

    Google Scholar 

  124. A. Jagota (1992), Efficiently Approximating Max-Clique in a Hopfield-style Network, InInter. Joint Conf. on Neural Networks 2, 248–253, NY.

    Google Scholar 

  125. A. Jagota and K. W. Regan (1992). Performance of Max-Clique Heuristics under Description — Length Weighted Distributions, Technical Report 92-24, Dept. of Comput. Sci, SUNY Buffalo, NY.

    Google Scholar 

  126. M. Jerrum (1990), The Elusiveness of Large Cliques in a Random Graph, Technical Report, Dept. of Comput. Sci. Univ. of Edinburgh.

  127. D. S. Johnson (1974), Approximation Algorithms for Combinatorial Problems,J. Computer. and System Sciences 9, 256–278.

    Google Scholar 

  128. D. S. Johnson and M. A. Trick (eds.), (1994), Clique, Graph Coloring, and Satisfiability: Second DIMACS Implementation Challenge,DIMACS Series, American Mathematical Society, to appear.

  129. D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou (1988), On Generating All Maximal Independent Sets,Information Processing Letters 27, 119–123.

    Google Scholar 

  130. E. L. Johnson and M. W. Padberg (1983), Degree-Two Inequalities, Clique Facets, and Bipartite Graphs,Annals of Discrete Mathematics 16, 169–188.

    Google Scholar 

  131. H. C. Johnston (1976). Cliques of a Graph: Variations on the Bron-Kerbosch Algorithm,Internat. J. Comput. and Inform Sci. 5, 209–238.

    Google Scholar 

  132. L. F. Johnson (1975). Determining Cliques of a Graph,Proc. of the fifth Manitoba Conf. on Num. Math.: 429–437.

  133. V. Kann (1992), On the Approximability of the Maximum Common Sub-graph Problem, submitted to STACS.

  134. N. Karmarkar (1990), An Interior Point Approach toNP-Complete Problems — Part I,Contemporary Mathematics 114, 297–308.

    Google Scholar 

  135. N. Karmarkar, M. G. C. Resende, and K. G. Ramakrishnan (1989), An Interior Point Approach to the Maximum Independent Set Problem in Dense Random Graphs, IX Intern. Conf. of the Chilean Comp. Sci. Society and XV Latin American Conf. on Informatics, Santiago, Chile.

  136. R. M. Karp and A. Wigderson (1985), A Fast Parallel Algorithm for the Maximal Independent Set Problem,J. ACM 32 (4).

  137. T. Kashiwabara and T. Fujisawa (1979),NP-Completeness of the Problem of Finding a Minimum-Clique-Number Interval Graph Containing a Given Graph as a Subgraph,Proceedings International Conference on Circuits and Systems: 657–660.

  138. T. Kashiwabara, S. Masuda, K. Nakajima, and T. Fujisawa (1992), Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc-Graph,Journal of Algorithms 13, 161–174.

    Google Scholar 

  139. B. Khoury and P. M. Pardalos (1993), An Algorithm for Finding the Maximum Clique on an Arbitrary Graph, Working Paper, University of Florida.

  140. P. Kikusts (1986), Another Algorithm Determining the Independence Number of a Graph,Elektron. Inf. Verarb. Kybern. ELK 22: 157–166.

    Google Scholar 

  141. P. N. Klein (1988), Efficient Parallel Algorithms for Chordal Graphs,Proc. 29th Annual Symp. on Foundations of Computer Science, IEEE: 150–161.

  142. P. G. Kolaitis and M. N. Thakur (1991), Approximation properties ofNP Minimization Problems,Proc. of 6th Annual Conf. on Structures in Computer Science: 353–366.

  143. R. Kopf (1987), Numerical Methods for Determining Independent Sets in Graphs (in German), Ph.D. Thesis, TH Leipzig.

    Google Scholar 

  144. R. Kopf and G. Ruhe (1987), A Computational Study of the Weighted Independent Set Problem for General Graphs,Foundations of Control Engineering 12 (4), 167–180.

    Google Scholar 

  145. S. M. Korman (1979), The Graph-Colouring Problem, inCombinatorial Optimization (N. Christofides, P. Toth, and C. Sandi, eds.), John Wiley & Sons, New York: 211–235.

    Google Scholar 

  146. M. Kubal and B. Jackowski (1985), A Generalized Implicit Enumeration Algorithm for Graph Coloring,Commun. ACM 28 (4), 412–418.

    Google Scholar 

  147. J. C. Lagarias and P. W. Shor (1992), Keller's Cube-Tilling Conjecture Is False in High Dimensions, Manuscript, Bell Laboratories.

  148. E. L. Lawler (1976),Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston.

  149. E. L. Lawler, J. K. Lenstra, and H. G. R. Kan (1980), Generating All Maximal Independent Sets:NP-Hardness and Polynomial-Time Algorithms,SIAM J. Comput. 9, 558–565.

    Google Scholar 

  150. Lecky, Murphy and Absher (1989), Graph Theoretic Algorithms for the PLA Folding Problem,IEEE Trans on Computer-Aided Design 8 (9), 1014–1021.

    Google Scholar 

  151. L. J. Leifman (1976), On Construction of All Maximal Complete Subgraphs (Cliques) of a Graph, Technical Report, Dept. of Math., Univ. Haifa, Israel.

    Google Scholar 

  152. N. Linial (1986), Hard Enumeration Problems in Geometry and Combinatorics,SIAM J. Alg. Disc. Math.,7 (2), 331–335.

    Google Scholar 

  153. R. Lipton and R. Tarjan (1979), A Separator Theorem for Planar Graphs,SIAM J. Appl. Math. 36, 346–358.

    Google Scholar 

  154. R. Lipton and R. Tarjan (1980), Applications of a Planar Separator Theorem,SIAM J. on Comput. 9 (3), 615–626.

    Google Scholar 

  155. E. Loukakis (1983), A New Backtracking Algorithm for Generating the Family of Maximal Independent Sets of a Graph,Comp. and Maths, with Appls. 9 (4), 583–589.

    Google Scholar 

  156. E. Loukakis and C. Tsouros (1981), A Depth First Search Algorithm to Generate the Family of Maximal Independent Sets of a Graph Lexicographically,Computing 27, 249–266.

    Google Scholar 

  157. E. Loukakis and C. Tsouros (1982), Determining the Number of Internal Stability of a Graph,Intern. J. Comp. Math. 11, 207–220.

    Google Scholar 

  158. E. Loukakis and C. Tsouros (1983), An Algorithm for the Maximum Internally Stable Set in a Weighted Graph,Int. J. Comput. Math. 13, 117–12.

    Google Scholar 

  159. L. Lovász (1979), On the Shannon Capacity of a Graph,IEEE Transactions on Information Theory 25, 1–7.

    Google Scholar 

  160. L. Lovász (1986),An Algorithmic Theory of Numbers, Graphs and Convexity SIAM, Philadelphia.

    Google Scholar 

  161. M. Luby (1986), A Simple Parallel Algorithm for the Maximum Independent Set Problem,SIAM J. Comput. 15 (4), 1036–1053.

    Google Scholar 

  162. R. D. Luce (1950), Connectivity and Generalized Cliques in Sociometric Group Structure,Psychometrika 15, 169–190.

    Google Scholar 

  163. J. MacWilliams and N. J. A. Sloane (1979),The Theory of Error Correcting Codes (Elsevier, American ed.), Amsterdam, North-Holland.

    Google Scholar 

  164. K. Maghout (1959), Sur la Determination des Nombres de Stabilité et du Nombre Chromatique d'un Graphe,C.R. Acad. Sci., Paris 248, 2522–2523.

    Google Scholar 

  165. P. M. Marcus (1964), Derivation of Maximal Compatibles Using Boolean Algebra,IBM J. Res. Develop. 8, 537–538.

    Google Scholar 

  166. S. Masuda and K. Nakajima (1988), An Optimal Algorithm for Finding a Maximum Independent Set of a Cricular-Arc Graph,SIAM J. Comput. 17 (1), 41–52.

    Google Scholar 

  167. S. Masuda, K. Nakajima, T. Kashiwabara, and T. Fujisawa (1990), Efficient Algorithms for Finding Maximum Cliques of an Overlap Graph,Networks 20, 157–171.

    Google Scholar 

  168. D. W. Matula (1970), On the Complete Subgraphs of a Random Graph,Proc. 2nd Conf. Combin. Theory and Appl., Chapel Hill, NC: 356–369.

  169. D. W. Matula (1976), The Largest Clique Size in a Random Graph, Technical Report CS 7608, Department of Computer Science, Southern Methodist University.

  170. J. A. McHugh (1990),Algorithmic Graph Theory, Prentice-Hall.

  171. W. Meeusen and L. Cuyvers (1975), Clique Detection in Directed Graphs: a New Algorithm,J. of Comp. and Appl. Math. 1, 185–193.

    Google Scholar 

  172. W. Meeusen and L. Cuyvers (1979), An Annotated Bibliograph of Clique-Detection Algorithms and Related Graph-Theoretical Problems, CAM Discussion Paper 7909, State University Center Antwerp.

  173. J. C. Meyer (1972), Ensembles Stables Maximaux dans les Hypergraphes, Comptes Rendus Acad. Sci. Paris274, 144–147.

    Google Scholar 

  174. H. Meyniel (1976), On the Perfect Graph Conjecture,Discrete Mathematics 16, 339–342.

    Google Scholar 

  175. H. Meyniel (1985), A New Property of Imperfect Graphs and Some Consequences, Technical Report, E.R. 1975 CNRS, Paris.

    Google Scholar 

  176. W. Miller (1994), Building Multiple Alignments from Pairwise Alignments, to appear inComputer Applications in the Biosciences.

  177. G. J. Minty (1980), On Maximal Independent Sets of Vertices in Claw-Free Graphs,J. Combin. Theory B 28, 284–304.

    Google Scholar 

  178. J. W. Moon and L. Moser, (1965), On Cliques in Graphs,Israel Journal of Mathematics 3, 23–28.

    Google Scholar 

  179. R. Motwani (1991), Clique Partitions, Graph Compression and Speeding-up Algorithms,STOC (Feder-Motwani).

  180. T. S. Motzkin and E. G. Straus (1965), Maxima for Graphs and a New Proof of a Theorem of Turan,Canadian Journal of Mathematics 17 (4), 533–540.

    Google Scholar 

  181. G. D. Mulligan and D. G. Corneil (1972), Corrections to Bierston's Algorithm for Generating Cliques,J. Assoc. Comput. Mach. 19, 244–247.

    Google Scholar 

  182. W. J. Murphy (1992), Computing Independent Sets in Graphs with Large Girth,Discrete Applied Math. 36 (2), 167–170.

    Google Scholar 

  183. J. Naor, M. Naor, and A. A. Schaffer (1987), Fast Parallel Algorithms for Chordal Graphs,proc. 19th Annual ACM Symp. on Theory of Computing, ACM: 355–364.

  184. G. L. Nemhauser and G. Sigismondi (1992), A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing,J. Opl Res. Soc. 43 (5), 443–457.

    Google Scholar 

  185. G. L. Nemhauser and L. E. Trotter, Jr. (1974), Properties of Vertex Packings and Independence System Polyhedra,Math. Programming 6, 48–61.

    Google Scholar 

  186. G. L. Nemhauser and L. E. Trotter (1975), Vertex Packings: Structural Properties and Algorithms,Math, Programming 8, 232–248.

    Google Scholar 

  187. G. L. Nemhauser and L.A. Wolsey (1988),Integer and Combinatorial Optimization, Wiley, New York.

    Google Scholar 

  188. S. Olariu (1989), Weak Bipolarizable Graphs,Discrete Mathematics 74, 159–171.

    Google Scholar 

  189. S. Onn (1992), On the Combinatorics of Permutation Polytopes,Journal of Combinatorial Theory, Series A.

  190. R. E. Osteen (1974), Clique Detection Algorithms Based on Line Addition and Line Removal,SIAM J. Appl. Math. 26, 126–135.

    Google Scholar 

  191. R. E. Osteen and J. T. Tou (1973), A Clique-Detection Algorithm Based on Neighborhoods in Graphs,Intern. J. Comput. Inf. Sci. 2, 257–268.

    Google Scholar 

  192. M. W. Padberg (1973), On the Facial Structure of Set Packing Polyhedra,Mathematical Programming 5, 199–216.

    Google Scholar 

  193. M. W. Padberg (1977), On the Complexity of Set Packing Polyhedra,Annals of Discrete Mathematics 1, 421–434.

    Google Scholar 

  194. M. W. Padberg (1979), Covering, Packing and Knapsack Problems,Annals of Discrete Mathematics 4, 265–287.

    Google Scholar 

  195. M. W. Padberg (1980), (1,k)-Configurations and Facets for Packing Problems,Mathematical Programming 18, 94–99.

    Google Scholar 

  196. Panconesi and Ranjan (1990), quantifers and Approximation,Proc. STOC 90.

  197. C. Papadimitriou and M. Yannakakis (1981), The Clique Problem for Planar Graphs,Inform. Proc. Letters 13, 131–133.

    Google Scholar 

  198. C. Papadimitriou and M. Yannakakis (1988), Optimization, Approximation and Complexity Classes, Proc. of the Twentieth Annual ACM STOC: 229–234.

  199. P. M. Pardalos and N. Desai (1991), An Algorithm for Finding a Maximum Weighted Independent Set in an Arbitrary Graph,Intern. J. Computer Math. 38, 163–175.

    Google Scholar 

  200. P. M. Pardalos and Y. Li (1991), Global Quadratic Optimization and the Maximum Clique Problem, Technical Report, Computer Science Department, The Penn. State Univ.

  201. P. M. Pardalos and A. T. Phillips, (1990), A Global Optimization Approach for Solving the Maximum Clique Problem,Intern. J. Computer Math. 33, 209–216.

    Google Scholar 

  202. P. M. Pardalos and G. Rodgers (1990), Parallel Branch and Bound algorithms for Quadratic Zero-One Programming on a Hypercube Architecture,Annals of Operations Research 22, 271–292.

    Google Scholar 

  203. P. M. Pardalos and G. Rodgers (1990), Computational Aspects of a Branch and Bound Algorithm for Quadratic Zero-One Programming,Computing 45, 131–144.

    Google Scholar 

  204. P. M. Pardalos and G. P. Rodgers (1992), A Branch and Bound Algorithm for the Maximum Clique Problem,Computers and Operations Research 19 (5), 363–375.

    Google Scholar 

  205. P. M. Pardalos and J. B. Rosen (1987),Constrained Global Optimization:Algorithms and Applications, Springer-verlag, Lecture Notes in Computer Science, Vol. 25.

  206. M. C. Paull and S. H. Unger (1959), Minimizing the Number of States in Incompletely Specified Sequential Switching Functions,IRE TRANS. Electronic Computers, EC-8: 356–367.

    Google Scholar 

  207. E. R. Peay, Jr. (1970), An Iterative Clique Detection Procedure, Michigan Math. Physcol. Program: MMPP 70-4.

  208. E. R. Peay, Jr. (1974), Hierarchical Clique Structures,Sociometry 37, 54–65.

    Google Scholar 

  209. O. Perron (1940), Über Lückenlose Ausfüllung des n-diemsnionalen Raumes durch kongruente Wurfel,Math. Z. 46, 1–26, 161–180. Zbl 22, 202.

    Google Scholar 

  210. J. C. Picard and M. Queyranne (1977), On the Integer-Valued Variables in the Linear Vertex Packing Problem,Math Prog. 12, 97–101.

    Google Scholar 

  211. B. Pittel (1982), On the Probable Behavior of Some Algorithms for Finding the Stability Number of a Graph,Math. Proc. Cambridge Philos. Soc. 92, 511–526.

    Google Scholar 

  212. S. Provan and M. O. Ball (1983), On the Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected,SIAM J. Comput. 12, 777–788.

    Google Scholar 

  213. W. R. Pulleyblank (1979), Minimum Node Covers and 2-Bicritical Graphs,Mathematical Programming 17, 91–103.

    Google Scholar 

  214. P. Raghavan (1988), Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs,J. Comput. System Sciences 37, 130–143.

    Google Scholar 

  215. J. Ramanujam and P. Sadayappanv (1988), Optimization by Neural Networks,IEEE International Conf. on Neural Networks, San Diego, July 24–27, II: 325–332.

  216. E. M. Reigold, J. Nievergelt, and N. Deo (1977),Combinatorial Algorithms:Theory and Practice, Prentice-Hall, Englewood Cliffs, NJ.

    Google Scholar 

  217. J. M. Robson (1986), Algorithms for Maximum Independent Sets,J. of Algorithms 7, 425–440.

    Google Scholar 

  218. D. J. Rose (1970), Triangulated Graphs and the Elimination Process,J. Math. Anal. Appl. 32, 597–609.

    Google Scholar 

  219. D. J. Rose, R. E. Tarjan, and G. S. Leuker (1976), Algorithmic Aspects of Vertex Elimination on Graphs,SIAM J. Comput. 5, 266–283.

    Google Scholar 

  220. D. Rotem and J. Urrutia (1981), Finding Maximum Cliques in Circle Graphs,Networks 11, 269–278.

    Google Scholar 

  221. B. E. Sagan (1988), A Note on Independent Sets in Trees,SIAM J. Disc. Math. 1 (1), 105–108.

    Google Scholar 

  222. L. Sanchis (1990), On the Complexity of Test Case Generation forNP-hard Problems,Inf. Processing Letters 36, 135–140.

    Google Scholar 

  223. L. Sanchis (1992), Test Case Construction for the Vertex Cover Problem (extended abstract), DIMACS Workshop on Computational Support for Discrete Mathematics.

  224. N. Sbihi (1980), Algorithme de Recherche d'un Stable de Cardinalité Maximum dans un Graph sans Étoile,Discrete Mathem. 29, 53–76.

    Google Scholar 

  225. C. E. Shannon (1956), The Zero-Error Capacity of a Noisy Channel,I.R.E. Transactions 3.

  226. N. Z. Shor (1990), Dual Quadratic Estimates in Polynomial and Boolean Programming,Computational Methods in Global Optimization (P. M. Pardalos and J. B. Rosen, eds.),Annals of Operations Research 25, 163–168.

  227. C. De Simone and A. Sassano (1993), Stability Number and Bull-and-Chair-Free Graphs,Discrete Applied Mathematics 41 (2), 121–129.

    Google Scholar 

  228. N. J. A. Sloane (1989), Unsolved Problems in Graph Theory Arising from the Study of Codes,J. Graph Theory Notes of New York 18, 11–20.

    Google Scholar 

  229. J. H. Spencer (1979), On Cliques in Graphs,Israel J. Math. 9, 419–421.

    Google Scholar 

  230. W. Staton (1979), Some Ramsey-Type Numbers and the Independence Ratio,Trans. Amer. Math. Soc. 256, 353–370.

    Google Scholar 

  231. S. K. Stein (1974), Algebraic Tiling,Amer. Math. Monthly 81, 445–462.

    Google Scholar 

  232. M. N. S. Swamy and K. Thulasiraman (1981),Graphs, Networks, and Algorithms, John Wiley and Sons.

  233. Y. Takefuji, L. Chen, K. Lee, and J. Huffman (1990), parallel Algorithms for Finding a Near-Maximum Independent Set of a Circle Graph,IEEE Transactions on Neural Networks 1, 263–267.

    Google Scholar 

  234. R. Tarjan (1972), Finding a Maximum Clique, Technical Report 72-123, Computer Sci. Dept., Cornell Univ., Ithaca, NY.

    Google Scholar 

  235. R. E. Tajan and A. E. Trojanowski (1977), Finding a Maximum Independent Set,SIAM Journal on Computing 6, 537–546.

    Google Scholar 

  236. R. E. Tajan and M. Yannakakis (1984), Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs,SIAM J. Computing 13 (3), 566–579.

    Google Scholar 

  237. I. Tomescu (1985),Problems in Combinatorics and Graph Theory, John Wiley and Sons.

  238. E. Tomita, Y. Kohata, and H. Takahashi (1988), A Simple Algorithm for Finding a Maximum Clique, Technical Report UEC-TR-C5.

  239. E. Tomita, S. Mitsuma, and H. Takahashi (1988), Two Algorithms for Finding a Near-Maximum Clique, Technical Report UEC-TR-C1.

  240. E. Tomita, A. Tanaka, and H. Takahashi (1988), The Worst-Case Time Complexity for Finding All the Cliques, Technical Report UEC-TR-C5.

  241. L. E. Trotter (1973), Solution Characteristics and Algorithms for the Vertex Packing Problem, Technical Report 168, Dept. of Operations Research, Cornell University, Ithaca, NY.

    Google Scholar 

  242. L. E. Trotter (1974), Vertex Packings: Structural Properties and Algorithms,Mathematical Programming 8, 232–248.

    Google Scholar 

  243. L. E. Trotter (1975), A Class of Facet Producing Graphs for Vertex Packing Polyhedra,Discrete Mathemtics 12, 373–388.

    Google Scholar 

  244. S. Tsukiyama, M. Ide, H. Aviyoshi, and I. Shirakawa (1977), A New Algorithm for Generating All the Maximum Independent Sets,SIAM J. on Comput. 6 (3), 505–517.

    Google Scholar 

  245. P. Turan (1954), On the Theory of Graphs,Colloq. Math. 3, 19–30.

    Google Scholar 

  246. L. G. Valiant (1979), The Complexity of Enumeration and Reliability Problems,SIAM J. Comput. 8, 410–421.

    Google Scholar 

  247. M. Vingron and P. Argos (1991), Motif Recognition and Alignment for Many Sequences by Comparison of Dot-Matrices,J. Molecular Biology 218, 33–43.

    Google Scholar 

  248. M. Vingron and P. A. Pevzner (1992), Multiple Sequence Comparison and n-Dimensional Image Reconstruction, Working paper.

  249. V. K. Wei (1981), Lower Bound on the Stability Number of a Simple Graph, Bell Laboratories Technical Memorandum, No. 81-11217-9.

  250. A. Wigderson (1983), Improving the Performance Guarantee for Approximate Graph Coloring,Journal of the Association for Computing Machinery 30 (3), 729–735.

    Google Scholar 

  251. H. S. Wilf (1986), The Number of Maximal Independent Sets in a Tree,SIAM J. Alg. Disc. Meth. 7 (1), 125–130.

    Google Scholar 

  252. H. S. Wilf (1986),Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, New Jersey.

    Google Scholar 

  253. H. S. Wilf (1986), Special Bounds for the Clique and Independence Numbers of Graphs,J. Combin. Theory B 40, 113–117.

    Google Scholar 

  254. S. Wimer, R. Y. Pinter, and J. Feldman (1987), Optimal Chaining of CMOS Transistors in a Functional Cell,IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, CAD-6(5): 795–801.

    Google Scholar 

  255. J. Xue (1991), Fast Algorithms for Vertex Packing and Related Problems, Ph.D. Thesis, GSIA, Carnegie Mellon University.

  256. J. Xue (1994), Edge-Maximal Triangulated Subgraphs and Heuristics for the Maximum Clique Problem,Networks, to appear.

  257. M. Yannakakis (1988), Expressing Combinatorial Optimization Problems as Linear Programs,Proc. of the Twentieth Annual ACM STOC: 223–228.

  258. M. Yannakakis (1992), On the Approximation of Maximum Satisfiability,Proc. 3rd Annual ACM-SIAM Symp. on Discrete Algorithms.

  259. G. Yu, P. Kouvelis, and S. Luo (1991), Weighted Vertex Packing Problem for Specially Structured Geometric Graphs, Technical Report, Dept. of Magmt. Sci. and Info. Syst., Univ. of Texas, Austin.

    Google Scholar 

  260. M.-S. Yu, L. Yu, and S.-J. Chang (1993), Sequencial and Parallel Algorithms for the Maximum-Weight Independent Set Problem on Permutation Graphs,Information Processing Letters 46, 7–11.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, 32611, Gainesville, FL, USA

    Panos M. Pardalos

  2. Graduate School of Management, Clark University, 950 Main Street, 01610, Worcester, MA, USA

    Jue Xue

Authors
  1. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jue Xue
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pardalos, P.M., Xue, J. The maximum clique problem. J Glob Optim 4, 301–328 (1994). https://doi.org/10.1007/BF01098364

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01098364

Key words

Search

Navigation