Using constraint programming to solve the maximum clique problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2833, Issue , 2003, Pages 634-648

  Régin, Jean Charles ^a  

^a IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONSTRAINT THEORY; GRAPH THEORY; OPTIMIZATION;

CARDINALITIES; COMBINATORIAL OPTIMIZATION PROBLEMS; CONSTRAINT PROGRAMMING; LOWER BOUNDS; MAXIMUM CLIQUE; MAXIMUM CLIQUE PROBLEMS; OPTIMAL SOLUTIONS; UPPER BOUND;

COMPUTER PROGRAMMING;

EID: 35248817260     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_43     Document Type: Article

References (11)

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