. Comme-travaux-futurs, nous aimerionsétudieraimerionsétudier l'utilisation de notre méthode de décomposition pour des probì emes de motif discovery o` u la résolution du SIP est utilisée comme un outil d'´ enumération [8]. Remerciements Cette recherche est supportée par la Région Wallonne, et par le PAI Moves

R. 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

L. P. Cordella, P. Foggia, C. Sansone, and M. Vento, An improved algorithm for matching large graphs, 3rd IAPR- TC15 Workshop on Graph-based Representations in Pattern Recognition, pp.149-159, 2001.

R. Dechter and R. Mateescu, AND/OR search spaces for graphical models, Artificial Intelligence, vol.171, issue.2-3, pp.73-106, 2007.
DOI : 10.1016/j.artint.2006.11.003

R. Dechter, Constraint Processing (The Morgan Kaufmann Series in Artificial Intelligence

R. Dechter and R. Mateescu, The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting, Proc. of the CP, 2004.
DOI : 10.1007/978-3-540-30201-8_56

P. Foggia, C. Sansone, and M. Vento, A database of graphs for isomorphism and sub-graph isomorphism benchmarking, 2001.

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability ; A Guide to the Theory of NP-Completeness, 1990.

J. A. Grochow and M. Kellis, Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking, RECOMB, pp.92-106, 2007.
DOI : 10.1007/978-3-540-71681-5_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.1696

G. Karypis and V. Kumar, A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.359-392, 1998.
DOI : 10.1137/S1064827595287997

J. Larrosa 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

W. Li and P. Van-beek, Guiding real-world SAT solving with dynamic hypergraph separator decomposition, Proc. of the 16th IEEE International Conference on Tools with Artificial Intelligence, 2004.

R. Mateescu, AND/OR Search Spaces for Graphical Models, 2007.

R. Mateescu and R. Dechter, AND/OR cutset conditioning, Proc. of the IJCAI'2005, 2005.

M. Rudolf, Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching, Theory and Application of Graph Transformations , number 1764 in Lecture Notes in Computer Science, pp.238-252, 1998.
DOI : 10.1007/978-3-540-46464-8_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.8764

J. Régin, Developpement d'outils algorithmiques pour l'intelligence artificielle : application a la chimie organique, 1995.

G. Valiente and C. Martínez, An algorithm for graph pattern-matching, Proc. 4th South American Workshop on String Processing of International Informatics Series, pp.180-197, 1997.

S. Zampelli, Y. Deville, and P. Dupont, Approximate Constrained Subgraph Matching, Principles and Pratice of Constraint Programming, pp.832-836, 2005.
DOI : 10.1007/11564751_74