R. Agrawal and R. Skirant, Fast algorithms for mining association rules, Proceedings of the 20th international conference on very large databases, pp.478-499, 1994.

C. Bessière and J. C. Régin, Mac and combined heuristics: two reasons to forsake fc (and cbj?) on hard problems, pp.61-75, 1996.

J. D. Cook and L. B. Holder, Mining graph data, 2006.

B. Douar, M. Liquiere, C. Latiri, and Y. Slimani, FGMAC: Frequent subgraph mining with Arc Consistency, Proceedings of the IEEE symposium on computational intelligence and data mining, pp.112-119, 2011.
DOI : 10.1109/cidm.2011.5949436

URL : https://hal.archives-ouvertes.fr/lirmm-00757478

B. Douar, M. Liquiere, C. Latiri, and Y. Slimani, Graph-based relational learning with a polynomial time projection algorithm, Proceedings of the 21st international conference on inductive logic programming, pp.96-112, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00757471

W. Fan, J. Li, J. Luo, Z. Tan, X. Wang et al., Incremental graph pattern matching, Proceedings of the 2011 international conference on Management of data, SIGMOD '11, pp.925-936, 2011.
DOI : 10.1145/2508020.2489791

URL : http://www.research.ed.ac.uk/portal/files/17894104/Fan_Li_ET_AL_2011_Incremental_Graph_Pattern_Matching.pdf

W. Fan, J. Li, S. Ma, N. Tang, Y. Wu et al., Graph pattern matching: from intractable to polynomial time, Proc. VLDB Endow, vol.3, issue.1-2, pp.264-275, 2010.

W. Fan, J. Li, S. Ma, H. Wang, and Y. Wu, Graph homomorphism revisited for graph matching, Proc. VLDB Endow, vol.3, issue.1-2, pp.1161-1172, 2010.

P. Hell and J. Nesetril, Graphs and homomorphism, vol.28, 2004.

J. Huan, W. Wang, and J. Prins, Efficient mining of frequent subgraphs in the presence of isomorphism, Proceedings of the 3rd IEEE international conference on data mining, ICDM '03, p.549, 2003.

A. Inokuchi, T. Washio, and H. Motoda, Complete mining of frequent patterns from graphs: mining graph data, Mach. Learn, vol.50, issue.3, pp.321-354, 2003.

M. Kuramochi and G. Karypis, Frequent subgraph discovery, International conference on data mining, pp.313-320, 2001.
DOI : 10.1109/icdm.2001.989534

M. Kuramochi and G. Karypis, An efficient algorithm for discovering frequent subgraphs, IEEE Trans Knowl Data Eng, vol.16, pp.1038-1051, 2004.

M. Liquiere, Arc consistency projection: a new generalization relation for graphs, ICCS, pp, pp.333-346, 2007.
URL : https://hal.archives-ouvertes.fr/lirmm-00196399

A. K. Mackworth, Consistency in networks of relations, Artif. Intell, vol.8, issue.1, pp.99-118, 1977.

S. Nijssen and J. N. Kok, The gaston tool for frequent subgraph mining, International workshop on graph-based tools (Grabats). Electronic notes in theoretical computer science, pp.77-87, 2004.
DOI : 10.1016/j.entcs.2004.12.039

URL : https://doi.org/10.1016/j.entcs.2004.12.039

F. J. Provost and T. Fawcett, Robust classification for imprecise environments, Mach. Learn, vol.42, issue.3, pp.203-231, 2001.

J. R. Quinlan, Read RC, Corneil DG (1977) The graph isomorphism disease, J. Graph Theory, vol.19, issue.1, pp.339-363, 1993.

F. Rossi, P. Van-beek, and T. Walsh, Handbook of constraint programming, 2006.

C. Solnon, Alldifferent-based filtering for subgraph isomorphism, Artif. Intell, vol.174, pp.850-864, 2010.
DOI : 10.1016/j.artint.2010.05.002

URL : https://hal.archives-ouvertes.fr/hal-01381476

M. Thoma, H. Cheng, A. Gretton, J. Han, H. P. Kriegel et al., Discriminative frequent subgraph mining with optimality guarantees, Stat. Anal. Data Min, vol.3, issue.5, pp.302-318, 2010.
DOI : 10.1002/sam.10084

URL : http://www.dbs.ifi.lmu.de/Publikationen/Papers/SAM2010.pdf

I. H. Witten and E. Frank, Data mining: practical machine learning tools and techniques, second edition (Morgan Kaufmann Series in Data Management Systems), 2005.

M. Wörlein, T. Meinl, I. Fischer, and M. Philippsen, A quantitative comparison of the subgraph miners mofa, gspan, ffsm, and gaston, European conference on machine learning and principles and practice of knowledge discovery in databases, vol.3721, pp.392-403, 2005.

X. Yan and J. Han, gspan: Graph-based substructure pattern mining, International conference on data mining, pp.721-724, 2002.

S. Zampelli, Y. Deville, and C. Solnon, Solving subgraph isomorphism problems with constraint programming, J Constraints, vol.15, pp.327-353, 2010.
DOI : 10.1007/s10601-009-9074-3

URL : https://hal.archives-ouvertes.fr/hal-01381438