I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo, The Maximum Clique Problem, Handbook of Combinatorial Optimization (Supplement Volume A), pp.1-74, 1999.
DOI : 10.1007/978-1-4757-3023-4_1

C. Bron and J. Kerbosch, Algorithm 457: finding all cliques of an undirected graph, Communications of the ACM, vol.16, issue.9, pp.575-579, 1973.
DOI : 10.1145/362342.362367

N. Chiba, T. Nishizeki, S. Abe, and T. Ozawa, A linear algorithm for embedding planar graphs using PQ-trees, Journal of Computer and System Sciences, vol.30, issue.1, pp.54-76, 1985.
DOI : 10.1016/0022-0000(85)90004-2

D. Conte, P. Foggia, C. Sansone, and M. Vento, THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION, International Journal of Pattern Recognition and Artificial Intelligence, vol.18, issue.03, pp.265-298, 2004.
DOI : 10.1142/S0218001404003228
URL : https://hal.archives-ouvertes.fr/hal-01408706

D. Conte, P. Foggia, and M. Vento, Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs, Journal of Graph Algorithms and Applications, vol.11, issue.1, pp.99-143, 2007.
DOI : 10.7155/jgaa.00139
URL : https://hal.archives-ouvertes.fr/hal-01408699

J. Crawford, M. Ginsberg, E. Luks, and A. Roy, Symmetry-breaking predicates for search problems, In KR, pp.148-159, 1996.

Y. Deville, G. Dooms, and S. Zampelli, Combining Two Structured Domains for Modeling Various Graph Matching Problems, Proceedings CSCLP 2007, pp.76-90, 2008.
DOI : 10.1109/TKDE.2003.1209024

G. Dooms, The CP(Graph) Computation Domain in Constraint Programming, 2006.

G. Dooms, Y. Deville, and P. Dupont, CP(Graph): Introducing a Graph Computation Domain in Constraint Programming, Proc CP 2005, 2005.
DOI : 10.1007/11564751_18

P. J. Durand, R. Pasari, J. W. Baker, and C. Tsai, An efficient algorithm for similarity analysis of molecules, Internet Journal of Chemistry, vol.2, issue.17, 1999.

F. Harary, Graph Theory, 1969.

N. Jussien, G. Rochart, and X. Lorca, Choco : an Open Source Java Constraint Programming Library, CPAIOR'08
URL : https://hal.archives-ouvertes.fr/hal-00483090

G. Katsirelos, N. Narodytska, and T. Walsh, On the Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry, Proceedings of the 16th international conference on Principles and practice of constraint programming, CP'10, pp.305-320, 2010.
DOI : 10.1007/978-3-642-15396-9_26
URL : https://hal.archives-ouvertes.fr/hal-00865476

I. Koch, Enumerating all connected maximal common subgraphs in two graphs, Theoretical Computer Science, vol.250, issue.1-2, pp.1-30, 2001.
DOI : 10.1016/S0304-3975(00)00286-3

B. Evgeny, K. Krissinel, and . Henrick, Common subgraph isomorphism detection by backtracking search. Software : Practice and Experience, pp.591-607, 2004.

J. Larossa and G. Valiente, Constraint satisfaction algorithms for graph pattern matching, Mathematical Structures in Computer Science, vol.12, issue.04, pp.403-422, 2002.
DOI : 10.1017/S0960129501003577

V. Le-clément, Y. Deville, and C. Solnon, Constraint-Based Graph Matching, Proc. Principles and Practice of Constraint Programming - CP 2009, pp.274-288, 2009.
DOI : 10.1007/3-540-70659-3_12

G. Levi, A note on the derivation of maximal common subgraphs of two directed or undirected graphs, Calcolo, vol.3, issue.4, pp.341-352, 1972.
DOI : 10.1007/BF02575586

J. J. Mcgregor, Backtrack search algorithm and the maximal common subgraph problem. Software Practice and Experience, Prosser and C. Unsworth. A connectivity constraint using bridges, pp.23-34707, 1981.

J. Puget, Breaking All Value Symmetries in Surjection Problems, Proceedings of the 11th international conference on Principles and practice of constraint programming, CP'05, pp.490-504, 2005.
DOI : 10.1007/11564751_37

J. Puget, Breaking symmetries in all different problems, IJCAI, pp.272-277, 2005.

J. Puget, An efficient way of breaking value symmetries, AAAI, 2006.

J. W. Raymond and P. Willett, Maximum common subgraph isomorphism algorithms for the matching of chemical structures, Journal of Computer-Aided Molecular Design, vol.16, issue.7, pp.521-533, 2002.
DOI : 10.1023/A:1021271615909

J. Régin, Développement d'outils algorithmiques pour l'Intelligence Artificielle et applica- tioñ A la chimie organique, Thèse de doctorat, 1995.

J. Régin, Using Constraint Programming to Solve the Maximum Clique Problem, Principles and Practice of Constraint Programming -CP 2003, pp.634-648, 2003.
DOI : 10.1007/978-3-540-45193-8_43

C. M. Roney-dougal, I. P. Gent, T. Kelsey, and S. Linton, Tractable symmetry breaking using restricted search trees, ECAI, pp.211-215, 2004.

M. Rudolf, Utilizing constraint satisfaction techniques for efficient graph pattern matching In 6th International Workshop on Theory and Application of Graph Transformations, Lecture Notes in Computer Science, vol.1764, pp.381-394, 1998.

S. Sorlin and C. Solnon, A parametric filtering algorithm for the graph isomorphism problem, Constraints, vol.58, issue.1???3, pp.518-537, 2008.
DOI : 10.1007/s10601-008-9044-1
URL : https://hal.archives-ouvertes.fr/hal-01500328

P. Van, H. , and L. Michel, Constraint-Based Local Search, 2005.

P. Vismara and B. Valery, Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms, Modelling, Computation and Optimization in Information Systems and Management Sciences, MCO 2008 Proceedings, pp.358-368, 2008.
DOI : 10.1016/j.ipl.2004.06.019
URL : https://hal.archives-ouvertes.fr/lirmm-00315748

T. Walsh, General Symmetry Breaking Constraints, CP, pp.650-664, 2006.
DOI : 10.1007/11889205_46

T. Walsh, Breaking Value Symmetry, Proceedings of the 13th international conference on Principles and practice of constraint programming , CP'07, pp.880-887, 2007.
DOI : 10.1007/978-3-540-74970-7_67

S. Zampelli, A Constraint Programming Approach to Subgraph Isomorphism, 2008.

S. Zampelli, Y. Deville, M. R. Sa¨?disa¨?di, and B. Benhamou, Symmetry breaking in subgraph isomorphism, SymCon'07, the Seventh International Workshop on Symmetry and Constraint Satisfaction Problem. A Satellite Workshop of CP, 2007.

S. Zampelli, Y. Deville, and C. Solnon, Solving subgraph isomorphism problems with constraint programming, Constraints, vol.23, issue.1, 2010.
DOI : 10.1007/s10601-009-9074-3
URL : https://hal.archives-ouvertes.fr/hal-01381438