The maximum clique problem

Journal of Global Optimization

Volumn 4, Issue 3, 1994, Pages 301-328

  Pardalos, Panos M ^a   Xue, Jue ^b  

^a UNIVERSITY OF FLORIDA   (United States)

^b CLARK UNIVERSITY   (United States)

Author keywords

algorithms; bibliography; graph coloring; heuristics; Maximum clique problem; NP hard; survey

Indexed keywords

EID: 0038579896     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/BF01098364     Document Type: Article

References (260)

1. Optima of Dual Integer Linear Programs
2. The Enumeration of Maximal Cliques of Large Graphs
3. On the Independence Ratio of a Graph
4. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
5. Upper Bounds on the Order of a Clique of a Graph
6. On the Intractability of Approximation Problems
7. Approximating the Maximum Clique is NP-Complete
8. An Analysis of Some Graph Theoretical Cluster Techniques
9. Structure Preserving Reductions among Convex Optimization Problems
10. A Relaxation Method for the Set Packing Problem Using Polyhedron Characteristic
11. Finding Maximum Cliques in Arbitrary and in Special Graphs
12. A Branch and Bound Algorithm for the Maximum Clique Problem
13. A Fast Algorithm for Finding an Edge-Maximal Subgraph with a TR-Formative Coloring
14. On the Maximum Weight Clique Problem
15. A Node Covering Algorithm
16. Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
17. Finding a Maximum Clique in an Arbitrary Graph
18. On Graphs with Polynomially Solvable Maximum-Weight Clique Problem
19. A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem
20. Habitat Dispersion in Forest Planning and the Stable Set Problem
21. On Maximal Chains
22. An Upper Bound on the Size of the Largest Cliques in a Graph
23. Cliques in Random Graphs
24. On Some Clustering Techniques
25. Polytope des Independants dans un Graphe Serie-Paralle
26. New Methods to Color the Vertices of a Graph
27. Algorithm 457: Finding All Cliques of an Undirected Graph
28. A New Table of Constant Weight Codes
29. Polynomial Algorithm to Recognize a Meyniel Graph
30. The Maximum Independent Set Problem for Cubic Planar Graph
31. An Exact Algorithm for the Maximum Clique Problem
32. Finding a Maximum Set of Independent Chords in a Circle
33. Arboricity and Subgraph Listing Algorithms
34. An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs
35. An Algorithm for Finding a Large Independent Set in Planar Graphs
36. An Approximation Algorithm for the Maximum Independent Set Problem in Cubic Planar Graphs
37. An Efficient Parallel Algorithm for Computing a Large Independent Set in a Planar Graph
38. On Certain Polytopes Associated with Graphs
39. Determining the Stability Number of a Graph
40. A Greedy Heuristic for the Set-Covering Problem
41. Perfectly Orderable Graphs
42. A Combinatorial Approach for Keller's Conjecture
43. A Note on the Approximation of the MAX CLIQUE Problem
44. A Fast Parallel Algorithms for Computing All Maximal Cliques in a Graph and the Related Problems
45. On Finding a Maximum Internally Stable Set on a Graph
46. A Property of 4-Chromatic Graphs and Some Remarks on Critical Graphs
47. On Rigid Circuit Graphs
48. A Note on the Detection of Cliques in Valued Graphs
49. Pseudo-Boolean Functions and Stability of Graphs
50. Covers and Packings in a Family of Sets
51. Lower Bounds for the Clique and the Chromatic Numbers of a Graph
52. Clique Numbers of Graphs
53. Über Iterierte Clique-Graphen
54. On the Greedy Heuristic for Continuous Covering and Packing Problems
55. Stabulus: A Technique for Finding Stable Sets in Large Graphs with Tabu Search
56. TABARIS: An Exact Algorithm Based on Tabu Search For Finding a Maximum Independent Set in a Graph
57. On the Independence Number of Random Graphs
58. The Number of Maximal Independent Sets in Connected Graphs
59. Algorithms for Minimum Colouring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
60. Algorithms for a Maximum Clique and a Maximum Independent Set of a Circle Graph
61. Algorithms on Circular Arc Graphs
62. Clique Detection for Nondirected Graphs: Two New Algorithms
63. Matrices with the Edmonds-Johnson Property
64. On Stable Set Polyhedra for K1,3 Free Graphs
65. A New Parallel Algorithm for the Maximal Independent Set Problem
66. Constructing a Maximal Independent Set in Parallel
67. A Simple Lower Bound for Monotone Clique Using a Communication Game
68. Stability in Circular-Arc-Graphs
69. Lower Bounds on the Independence Number in Terms of the Degrees
70. The Maximum Number of Maximal Independent Sets in a Connected Graph
71. Random Near-Regular Graphs and the Node Packing Problem
72. The Ellipsoid Method and Its Consequences in Combinatorial Optimization
73. Relaxations of Vertex Packing
74. Polynomial Algorithms for Perfect Graphs
75. Efficient Algorithms for Interval Graphs and Circular-Arc Graphs
76. Active constraints, Indefinite Quadratic Programming and Test Problems
77. Maximum Internally Stable Sets of a Graph
78. Degrés et Nombre de Stabilité d'un Graph
79. Upper Bounds for the Stability Number of a Graph
80. Two Algorithms for Maximum Cliques in Dense Graphs
81. A Procedure for Clique Detection Using the Group Matrix
82. Test Case Generators and Computational Results for the Maximum Clique Problem
83. Weakly Triangulated Graphs
84. Optimizing Weakly Triangulated Graphs
85. The Maximum Number of Cliques in Dense Graphs
86. On Linear Systems with Integral Valued Solutions
87. Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring of Chordal Graphs
88. Hard Graphs for the Maximum Clique Problem
89. On the Vertex Packing Problem
90. An Algorithm for the Vertex Packing Problem
91. Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
92. The Coloring and Maximum Independent Set Problems on Planar Perfect Graphs
93. A Polynomial Algorithm for Maximum Weighted Vertex Packings on Graphs without Long Odd Cycles
94. An Input-Output Approach to Clique Identification
95. Efficiently Approximating Max-Clique in a Hopfield-style Network
96. Performance of Max-Clique Heuristics under Description — Length Weighted Distributions
97. Approximation Algorithms for Combinatorial Problems
98. On Generating All Maximal Independent Sets
99. Degree-Two Inequalities, Clique Facets, and Bipartite Graphs
100. Cliques of a Graph: Variations on the Bron-Kerbosch Algorithm
101. An Interior Point Approach to NP-Complete Problems — Part I
102. Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc-Graph
103. Another Algorithm Determining the Independence Number of a Graph
104. Numerical Methods for Determining Independent Sets in Graphs (in German)
105. A Computational Study of the Weighted Independent Set Problem for General Graphs
106. The Graph-Colouring Problem
107. A Generalized Implicit Enumeration Algorithm for Graph Coloring
108. Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
109. Graph Theoretic Algorithms for the PLA Folding Problem
110. On Construction of All Maximal Complete Subgraphs (Cliques) of a Graph
111. Hard Enumeration Problems in Geometry and Combinatorics
112. A Separator Theorem for Planar Graphs
113. Applications of a Planar Separator Theorem
114. A New Backtracking Algorithm for Generating the Family of Maximal Independent Sets of a Graph
115. A Depth First Search Algorithm to Generate the Family of Maximal Independent Sets of a Graph Lexicographically
116. Determining the Number of Internal Stability of a Graph
117. An Algorithm for the Maximum Internally Stable Set in a Weighted Graph
118. On the Shannon Capacity of a Graph
119. A Simple Parallel Algorithm for the Maximum Independent Set Problem
120. Connectivity and Generalized Cliques in Sociometric Group Structure
121. Sur la Determination des Nombres de Stabilité et du Nombre Chromatique d'un Graphe
122. Derivation of Maximal Compatibles Using Boolean Algebra
123. An Optimal Algorithm for Finding a Maximum Independent Set of a Cricular-Arc Graph
124. Efficient Algorithms for Finding Maximum Cliques of an Overlap Graph
125. Clique Detection in Directed Graphs: a New Algorithm
126. Ensembles Stables Maximaux dans les Hypergraphes
127. On the Perfect Graph Conjecture
128. A New Property of Imperfect Graphs and Some Consequences
129. On Maximal Independent Sets of Vertices in Claw-Free Graphs
130. On Cliques in Graphs
131. Maxima for Graphs and a New Proof of a Theorem of Turan
132. Corrections to Bierston's Algorithm for Generating Cliques
133. Computing Independent Sets in Graphs with Large Girth
134. A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
135. Properties of Vertex Packings and Independence System Polyhedra
136. Vertex Packings: Structural Properties and Algorithms
137. Weak Bipolarizable Graphs
138. Clique Detection Algorithms Based on Line Addition and Line Removal
139. A Clique-Detection Algorithm Based on Neighborhoods in Graphs
140. On the Facial Structure of Set Packing Polyhedra
141. On the Complexity of Set Packing Polyhedra
142. Covering, Packing and Knapsack Problems
143. (1, k)-Configurations and Facets for Packing Problems
144. The Clique Problem for Planar Graphs
145. An Algorithm for Finding a Maximum Weighted Independent Set in an Arbitrary Graph
146. A Global Optimization Approach for Solving the Maximum Clique Problem
147. Parallel Branch and Bound algorithms for Quadratic Zero-One Programming on a Hypercube Architecture
148. Computational Aspects of a Branch and Bound Algorithm for Quadratic Zero-One Programming
149. A Branch and Bound Algorithm for the Maximum Clique Problem
150. Hierarchical Clique Structures
151. Über Lückenlose Ausfüllung des n-diemsnionalen Raumes durch kongruente Wurfel
152. On the Integer-Valued Variables in the Linear Vertex Packing Problem
153. On the Probable Behavior of Some Algorithms for Finding the Stability Number of a Graph
154. On the Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
155. Minimum Node Covers and 2-Bicritical Graphs
156. Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs
157. Algorithms for Maximum Independent Sets
158. Triangulated Graphs and the Elimination Process
159. Algorithmic Aspects of Vertex Elimination on Graphs
160. Finding Maximum Cliques in Circle Graphs
161. A Note on Independent Sets in Trees
162. On the Complexity of Test Case Generation for NP-hard Problems
163. Algorithme de Recherche d'un Stable de Cardinalité Maximum dans un Graph sans Étoile
164. Stability Number and Bull-and-Chair-Free Graphs
165. Unsolved Problems in Graph Theory Arising from the Study of Codes
166. On Cliques in Graphs
167. Some Ramsey-Type Numbers and the Independence Ratio
168. Algebraic Tiling
169. parallel Algorithms for Finding a Near-Maximum Independent Set of a Circle Graph
170. Finding a Maximum Clique
171. Finding a Maximum Independent Set
172. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
173. Solution Characteristics and Algorithms for the Vertex Packing Problem
174. Vertex Packings: Structural Properties and Algorithms
175. A Class of Facet Producing Graphs for Vertex Packing Polyhedra
176. A New Algorithm for Generating All the Maximum Independent Sets
177. On the Theory of Graphs
178. The Complexity of Enumeration and Reliability Problems
179. Motif Recognition and Alignment for Many Sequences by Comparison of Dot-Matrices
180. Improving the Performance Guarantee for Approximate Graph Coloring
181. The Number of Maximal Independent Sets in a Tree
182. Special Bounds for the Clique and Independence Numbers of Graphs
183. 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.
184. Weighted Vertex Packing Problem for Specially Structured Geometric Graphs
185. Sequencial and Parallel Algorithms for the Maximum-Weight Independent Set Problem on Permutation Graphs