D. Achlioptas, M. S. Molloy, L. M. Kirousis, Y. C. Stamatiou, E. Kranakis et al., Random constraint satisfaction: A more accurate picture, Constraints, vol.6, issue.4, pp.329-344, 2001.
DOI : 10.1007/BFb0017433

C. Anton and L. Olson, Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism, Advances in Artificial Intelligence, pp.16-26, 2009.
DOI : 10.1007/978-3-540-85958-1_21

G. Audemard, C. Lecoutre, M. S. Modeliar, G. Goncalves, and D. C. Porumbel, Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem, Principles and Practice of Constraint Programming -20th International Conference of Lecture Notes in Computer Science, pp.125-141, 2014.
DOI : 10.1007/978-3-319-10428-7_12

G. Audemard and L. Simon, On the Glucose SAT Solver, International Journal on Artificial Intelligence Tools, vol.6, issue.4, 2014.
DOI : 10.1016/S1571-0661(05)82542-3

M. Azaouzi and L. B. Romdhane, A Minimal Rare Substructures-Based Model for Graph Database Indexing, Intelligent Systems Design and Applications -16th International Conference on Intelligent Systems Design and Applications of Advances in Intelligent Systems and Computing, pp.250-259, 2016.
DOI : 10.1007/s00778-013-0306-1

F. Bacchus and A. J. Grove, On the forward checking algorithm, Principles and Practice of Constraint Programming -CP'95, First International Conference, CP'95 Proceedings, pp.292-308, 1995.
DOI : 10.1007/3-540-60299-2_18

R. Battiti and F. Mascia, An algorithm portfolio for the sub-graph isomorphism problem Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics, International Workshop, SLS, Proceedings of Lecture Notes in Computer Science, pp.106-120, 2007.

V. Bonnici and R. Giugno, On the Variable Ordering in Subgraph Isomorphism Algorithms, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.14, issue.1, pp.193-203, 2017.
DOI : 10.1109/TCBB.2016.2515595

N. Cao, Z. Yang, C. Wang, K. Ren, and W. Lou, Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing, 2011 31st International Conference on Distributed Computing Systems, pp.393-402, 2011.
DOI : 10.1109/ICDCS.2011.84
URL : http://www.cnsr.ictas.vt.edu/publication/ICDCS11-Cao.pdf

V. Carletti, P. Foggia, A. Saggese, and M. Vento, Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.40, issue.4, pp.1-1, 2017.
DOI : 10.1109/TPAMI.2017.2696940

V. Carletti, Exact and Inexact Methods for Graph Similarity in Structural Pattern Recognition, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01315389

V. Carletti, P. Foggia, A. Saggese, and M. Vento, Introducing VF3: A new algorithm for subgraph isomorphism Graph-Based Representations in Pattern Recognition -11th IAPR-TC-15 International Workshop, Proceedings of Lecture Notes in Computer Science, pp.128-139, 2017.

V. Carletti, P. Foggia, and M. Vento, VF2 plus: An improved version of VF2 for biological graphs Graph-Based Representations in Pattern Recognition -10th IAPR-TC-15 International Workshop, of Lecture Notes in Computer Science, pp.168-177, 2015.

P. Cheeseman, B. Kanefsky, and W. M. Taylor, Where the really hard problems are, Proceedings of the 12th International Joint Conference on Artificial Intelligence, pp.331-340, 1991.

J. Cheng, Y. Ke, W. Ng, and A. Lu, Fg-index, Proceedings of the 2007 ACM SIGMOD international conference on Management of data , SIGMOD '07, pp.857-872, 2007.
DOI : 10.1145/1247480.1247574

R. Chirkova, A. Dogac, M. T. Ozsu, and T. K. Sellis, The Marmara Hotel, Proceedings of the 23rd International Conference on Data Engineering, 2007.

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.31, issue.03, pp.265-298, 2004.
DOI : 10.1109/3477.956043
URL : https://hal.archives-ouvertes.fr/hal-01408706

L. P. Cordella, P. Foggia, C. Sansone, and M. Vento, A (sub)graph isomorphism algorithm for matching large graphs, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.10, pp.26-1367, 2004.
DOI : 10.1109/TPAMI.2004.75

G. Damiand, C. Solnon, C. De-la-higuera, J. Janodet, and ´. E. Samuel, Polynomial algorithms for subisomorphism of nD open combinatorial maps, Computer Vision and Image Understanding, vol.115, issue.7, pp.115-996, 2011.
DOI : 10.1016/j.cviu.2010.12.013
URL : https://hal.archives-ouvertes.fr/hal-00597483

P. J. Davis, Leonhard Euler's Integral: A Historical Profile of the Gamma Function, The American Mathematical Monthly, vol.34, issue.10, pp.66-849, 1959.
DOI : 10.1080/00029890.1959.11989422

. Inc, Daylight theory manual, version 4.9, 2011.

M. J. Dent, Minimal Forward Checking?a Lazy Constraint Satisfaction Search Algorithm: Experimental And Theoretical Results, 1996.

M. J. Dent and R. E. Mercer, Minimal forward checking, Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94, pp.432-438, 1994.
DOI : 10.1109/TAI.1994.346460

P. Erd?-os and A. Rényi, On random graphs I, pp.290-297, 1959.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

M. Gebser, B. Kaufmann, R. Kaminski, M. Ostrowski, T. Schaub et al., Potassco: The potsdam answer set solving collection, pp.107-124, 2011.
DOI : 10.1007/978-3-642-02846-5_22
URL : http://www.cs.uni-potsdam.de/wv/pdfformat/geossc09a.pdf

I. P. Gent, Heuristic solution of open bin packing problems, Journal of Heuristics, vol.3, issue.4, pp.299-304, 1998.
DOI : 10.1023/A:1009678411503

I. P. Gent, E. Macintyre, P. Prosser, B. M. Smith, and T. Walsh, An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem, Proceedings of the Second International Conference on Principles and Practice of Constraint Programming of Lecture Notes in Computer Science, pp.179-193, 1996.
DOI : 10.1007/3-540-61551-2_74

I. P. Gent, E. Macintyre, P. Prosser, B. M. Smith, and T. Walsh, Random constraint satisfaction: Flaws and structure, Constraints, vol.6, issue.4, pp.345-372, 2001.
DOI : 10.1023/A:1011454308633

I. P. Gent, E. Macintyre, P. Prosser, and T. Walsh, The constrainedness of search, Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, AAAI 96, IAAI 96, pp.246-252, 1996.

I. P. Gent and T. Walsh, Phase transitions from real computational problems, Proceedings of the 8th International Symposium on Artificial Intelligence, pp.356-364, 1995.

E. N. Gilbert, Random Graphs, The Annals of Mathematical Statistics, vol.30, issue.4, pp.1141-1144, 1959.
DOI : 10.1214/aoms/1177706098

R. Giugno, V. Bonnici, N. Bombieri, A. Pulvirenti, A. Ferro et al., GRAPES: A Software for Parallel Searching on Biological Graphs Targeting Multi-Core Architectures, PLoS ONE, vol.28, issue.10, pp.1-11, 2013.
DOI : 10.1371/journal.pone.0076911.s002

C. P. Gomes and B. Selman, Algorithm portfolios, Artificial Intelligence, vol.126, issue.1-2, pp.43-62, 2001.
DOI : 10.1016/S0004-3702(00)00081-3

U. Grömping, R package FrF2 for creating and analyzing fractional factorial 2-level designs, Journal of Statistical Software, vol.56, issue.1, pp.1-56, 2014.

A. A. Hagberg, D. A. Schult, and P. J. Swart, Exploring network structure, dynamics, and function using NetworkX, Proceedings of the 7th Python in Science Conference (SciPy2008), pp.11-15, 2008.

J. Han, H. Cheng, D. Xin, and X. Yan, Frequent pattern mining: current status and future directions, Data Mining and Knowledge Discovery, vol.1, issue.1, pp.55-86, 2007.
DOI : 10.1007/s10618-006-0059-1
URL : https://link.springer.com/content/pdf/10.1007%2Fs10618-006-0059-1.pdf

R. M. Haralick and G. L. Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, pp.263-313, 1980.
DOI : 10.1016/0004-3702(80)90051-X

Y. He, F. Lin, P. R. Chipman, C. M. Bator, T. S. Baker et al., Structure of decay-accelerating factor bound to echovirus 7: A virus-receptor complex, Proceedings of the National Academy of Sciences, vol.83, issue.1, pp.99-10325, 2002.
DOI : 10.1099/0022-1317-83-1-45

L. Hong, L. Zou, X. Lian, and P. S. Yu, Subgraph Matching with Set Similarity in a Large Graph Database, IEEE Transactions on Knowledge and Data Engineering, vol.27, issue.9, pp.2507-2521, 2015.
DOI : 10.1109/TKDE.2015.2391125

H. Jiang, H. Wang, P. S. Yu, and S. Zhou, GString: A Novel Approach for Efficient Search in Graph Databases, 2007 IEEE 23rd International Conference on Data Engineering, pp.566-575, 2007.
DOI : 10.1109/ICDE.2007.367902

F. Katsarou, N. Ntarmos, and P. Triantafillou, Performance and scalability of indexed subgraph query processing methods, Proceedings of the VLDB Endowment, vol.8, issue.12, pp.1566-1577, 2015.
DOI : 10.14778/2824032.2824054

F. Katsarou, N. Ntarmos, P. V. Triantafillou, S. Orlando, B. Mitschang et al., Subgraph querying with parallel use of query rewritings and alternative algorithms, Markl, Proceedings of the 20th International Conference on Extending Database Technology, EDBT 2017, pp.25-36, 2017.

L. Kotthoff, C. Mccreesh, and C. Solnon, Portfolios of Subgraph Isomorphism Algorithms, Learning and Intelligent Optimization -10th International Conference of Lecture Notes in Computer Science, pp.107-122, 2016.
DOI : 10.1007/s10601-009-9074-3
URL : https://hal.archives-ouvertes.fr/hal-01301829

J. Larrosa and P. Meseguer, Partial lazy forward checking for MAX-CSP, ECAI, pp.229-233, 1998.

J. Lee, W. Han, R. Kasperovics, and J. Lee, An in-depth comparison of subgraph isomorphism algorithms in graph databases, Proceedings of the VLDB Endowment, vol.6, issue.2, pp.133-144, 2012.
DOI : 10.14778/2535568.2448946

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, 1973.
DOI : 10.1007/BF02575586

K. Leyton-brown, H. H. Hoos, F. Hutter, and L. Xu, -complete problems, Communications of the ACM, vol.57, issue.5, pp.98-107, 2014.
DOI : 10.1145/2594413.2594424

C. Mccreesh, Solving Hard Subgraph Problems in Parallel, 2017.

C. Mccreesh, S. N. Ndiaye, P. Prosser, and C. Solnon, Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems, Principles and Practice of Constraint Programming -22nd International Conference Proceedings of Lecture Notes in Computer Science, pp.350-368, 2016.
DOI : 10.1007/978-3-540-87477-5_39
URL : https://hal.archives-ouvertes.fr/hal-01331298

C. Mccreesh and P. Prosser, A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs, Principles and Practice of Constraint Programming -21st International Conference, CP 2015 Proceedings, pp.295-312, 2015.
DOI : 10.1007/978-3-319-23219-5_21

C. Mccreesh, P. Prosser, and J. Trimble, Heuristics and really hard instances for subgraph isomorphism problems, Proceedings of the Twenty- Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, pp.9-15, 2016.

D. G. Mitchell, B. Selman, and H. J. Levesque, Hard and easy distributions of SAT problems, Proceedings of the 10th National Conference on Artificial Intelligence, pp.459-465, 1992.

A. C. Murray, Customising compilers for customisable processors, 2012.

P. Peng, L. Zou, L. Chen, X. Lin, and D. Zhao, Answering subgraph queries over massive disk resident graphs, World Wide Web, vol.2, issue.1, pp.417-448, 2016.
DOI : 10.1145/1353343.1353369

J. Régin, A filtering algorithm for constraints of difference in csps, Proceedings of the 12th National Conference on Artificial Intelligence, pp.362-367, 1994.

S. Segundo, P. Rodríguez-losada, D. Jiménez, and A. , An exact bit-parallel algorithm for the maximum clique problem, Computers & Operations Research, vol.38, issue.2, pp.571-581, 2011.
DOI : 10.1016/j.cor.2010.07.019

M. D. Santo, P. Foggia, C. Sansone, and M. Vento, A large database of graphs and its use for benchmarking graph isomorphism algorithms, Pattern Recognition Letters, vol.24, issue.8, pp.24-1067, 2003.
DOI : 10.1016/S0167-8655(02)00253-2

H. Shang, Y. Zhang, X. Lin, and J. X. Yu, Taming verification hardness, Proceedings of the VLDB Endowment, vol.1, issue.1, pp.364-375, 2008.
DOI : 10.14778/1453856.1453899

D. E. Shasha, J. T. Wang, and R. Giugno, Algorithmics and applications of tree and graph searching, Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '02, pp.39-52, 2002.
DOI : 10.1145/543613.543620

Y. Shen, Z. Zou, A. Bouguettaya, Y. Gao, A. Klimenko et al., Efficient Subgraph Matching on Non-volatile Memory, Web Information Systems Engineering -WISE 2017 -18th International Conference Proceedings , Part I of Lecture Notes in Computer Science, pp.457-471, 2017.
DOI : 10.1145/367766.368168

B. M. Smith and M. E. Dyer, Locating the phase transition in binary constraint satisfaction problems, Artificial Intelligence, vol.81, issue.1-2, pp.155-181, 1996.
DOI : 10.1016/0004-3702(95)00052-6

B. M. Smith and S. A. Grant, Modelling exceptionally hard constraint satisfaction problems, Principles and Practice of Constraint Programming - CP97, Third International Conference Proceedings, pp.182-195, 1997.
DOI : 10.1007/BFb0017439

C. Solnon, AllDifferent-based filtering for subgraph isomorphism, Artificial Intelligence, vol.174, issue.12-13, pp.12-13, 2010.
DOI : 10.1016/j.artint.2010.05.002
URL : https://hal.archives-ouvertes.fr/hal-01381476

C. Solnon, G. Damiand, C. De-la-higuera, and J. Janodet, On the complexity of submap isomorphism and maximum common submap problems, Pattern Recognition, vol.48, issue.2, pp.302-316, 2015.
DOI : 10.1016/j.patcog.2014.05.019
URL : https://hal.archives-ouvertes.fr/hal-01022418

A. Steger and N. C. Wormald, Generating Random Regular Graphs Quickly, Combinatorics, Probability and Computing, vol.8, issue.4, pp.377-396, 1999.
DOI : 10.1017/S0963548399003867

Y. Tian and J. M. Patel, TALE: A Tool for Approximate Large Graph Matching, 2008 IEEE 24th International Conference on Data Engineering, pp.963-972, 2008.
DOI : 10.1109/ICDE.2008.4497505
URL : http://www.eecs.umich.edu/periscope/publ/tale-full.pdf

J. R. Ullmann, An Algorithm for Subgraph Isomorphism, Journal of the ACM, vol.23, issue.1, pp.31-42, 1976.
DOI : 10.1145/321921.321925
URL : http://www.cs.bgu.ac.il/~dinitz/Course/SS-12/Ullman_Algorithm.pdf

C. Vehlow, H. Stehr, M. Winkelmann, J. M. Duarte, L. Petzold et al., CMView: Interactive contact map visualization and analysis, Bioinformatics, vol.58, issue.1, pp.27-1573, 2011.
DOI : 10.1016/S0083-6729(00)58025-X
URL : https://academic.oup.com/bioinformatics/article-pdf/27/11/1573/5903168/btr163.pdf

T. Walsh, The constrainedness knife-edge, Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, AAAI 98, IAAI 98, pp.406-411, 1998.

G. Wang, B. Wang, X. Yang, and G. Yu, Efficiently Indexing Large Sparse Graphs for Similarity Search, IEEE Transactions on Knowledge and Data Engineering, vol.24, issue.3, pp.440-451, 2012.
DOI : 10.1109/TKDE.2010.28

J. Wang, N. Ntarmos, P. Triantafillou, E. Pitoura, S. Maabout et al., Indexing query graphs to speedup graph query processing, Proceedings of the 19th International Conference on Extending Database Technology, EDBT 2016, pp.41-52, 2016.

X. Yan, P. S. Yu, and J. Han, Graph indexing, Proceedings of the 2004 ACM SIGMOD international conference on Management of data , SIGMOD '04, pp.335-346, 2004.
DOI : 10.1145/1007568.1007607

X. Yan, P. S. Yu, and J. Han, Graph indexing based on discriminative frequent structure analysis, ACM Transactions on Database Systems, vol.30, issue.4, pp.960-993, 2005.
DOI : 10.1145/1114244.1114248
URL : http://www.cs.ucsb.edu/~xyan/papers/tods05_graph.pdf

D. Yuan and P. Mitra, Lindex: a lattice-based index for graph databases, The VLDB Journal, vol.3, issue.1, pp.229-252, 2013.
DOI : 10.1109/ICDE.2007.368956

D. Yuan, P. Mitra, and C. L. Giles, Mining and indexing graphs for supergraph search, Proceedings of the VLDB Endowment, vol.6, issue.10, pp.829-840, 2013.
DOI : 10.14778/2536206.2536211
URL : http://www.vldb.org/pvldb/vol6/p829-yuan.pdf

D. Yuan, P. Mitra, H. Yu, and C. L. Giles, Updating Graph Indices with a One-Pass Algorithm, Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, SIGMOD '15, pp.1903-1916, 2015.
DOI : 10.1145/1516360.1516385

S. Zampelli, Y. Deville, and C. Solnon, Solving subgraph isomorphism problems with constraint programming, Constraints, vol.23, issue.1, pp.327-353, 2010.
DOI : 10.1007/978-3-662-04921-1
URL : https://hal.archives-ouvertes.fr/hal-01381438

S. Zhang, M. Hu, and J. Yang, TreePi: A Novel Graph Indexing Method, 2007 IEEE 23rd International Conference on Data Engineering, pp.966-975, 2007.
DOI : 10.1109/ICDE.2007.368955
URL : https://mailserver.di.unipi.it/ricerca/proceedings/ICDE07/content/data/095_R24-3-513-Zhang.pdf

S. Zhang, S. Li, and J. Yang, GADDI, Proceedings of the 12th International Conference on Extending Database Technology Advances in Database Technology, EDBT '09, pp.192-203, 2009.
DOI : 10.1145/1516360.1516384

P. Zhao and J. Han, On graph query optimization in large networks, Proceedings of the VLDB Endowment, vol.3, issue.1-2, pp.340-351, 2010.
DOI : 10.14778/1920841.1920887

P. Zhao, J. X. Yu, P. S. Yu, J. Gehrke, M. N. Garofalakis et al., Graph indexing: Tree + delta >= graph, Proceedings of the 33rd International Conference on Very Large Data Bases, pp.938-949, 2007.

W. Zheng, X. Lian, L. Zou, L. Hong, and D. Zhao, Online Subgraph Skyline Analysis over Knowledge Graphs, IEEE Transactions on Knowledge and Data Engineering, vol.28, issue.7, pp.1805-1819, 2016.
DOI : 10.1109/TKDE.2016.2530063