M. Basu, B. , and T. K. , Data Complexity in Pattern Recognition, 2006.
DOI : 10.1007/978-1-84628-172-3

C. Capelle, M. Habib, and F. D. Montgolfier, Graph decompositions and factorizing permutations, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, pp.55-70, 2002.
DOI : 10.1109/ISTCS.1997.595165
URL : https://hal.archives-ouvertes.fr/hal-00958972

C. Chen, C. X. Lin, M. Fredrikson, M. Christodorescu, X. Yan et al., Mining graph patterns efficiently via randomized summaries, Proc. VLDB Endow, pp.742-753, 2009.
DOI : 10.14778/1687627.1687711
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.301.687

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

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.1367-1372, 2004.
DOI : 10.1109/TPAMI.2004.75

E. Dahlhaus, J. Gustedt, and R. Mcconnell, Efficient and practical modular decomposition, eighth annual ACM-SIAM symposium on Discrete algorithms, pp.26-35, 1997.
DOI : 10.1006/jagm.2001.1185
URL : https://hal.archives-ouvertes.fr/inria-00100822

W. Fan, J. Li, S. Ma, N. Tang, Y. Wu et al., Graph pattern matching, Proc. VLDB Endow, pp.264-275, 2010.
DOI : 10.14778/1920841.1920878

W. Fan, J. Li, X. Wang, and Y. Wu, Query preserving graph compression, Proceedings of the 2012 international conference on Management of Data, SIGMOD '12, pp.157-168, 2012.
DOI : 10.1145/2213836.2213855

B. Gallagher, Matching structure and semantics: A survey on graph-based pattern matching, AAAI FS, vol.6, pp.45-53, 2006.

T. Gallai, Transitiv orientierbare Graphen, Acta Mathematica Academiae Scientiarum Hungaricae, vol.51, issue.1-2, pp.25-66, 1967.
DOI : 10.1007/BF02020961

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

M. Habib, F. D. Montgolfier, P. , and C. , A simple linear-time modular decomposition algorithm for graphs, Scandinavian Workshop on Algorithm Theory -SWAT, pp.187-198, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00159601

M. Habib and C. Paul, A survey of the algorithmic aspects of modular decomposition, Computer Science Review, vol.4, issue.1, pp.41-59, 2010.
DOI : 10.1016/j.cosrev.2010.01.001

H. He and A. Singh, Closure-tree: An index structure for graph queries, Data Engineering, 2006. ICDE '06. Proceedings of the 22nd International Conference on, pp.38-38, 2006.

H. He and A. K. Singh, Graphs-at-a-time, Proceedings of the 2008 ACM SIGMOD international conference on Management of data , SIGMOD '08, pp.405-418, 2008.
DOI : 10.1145/1376616.1376660

K. G. Khoo and P. N. Suganthan, Multiple relational graphs mapping using genetic algorithms, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546), pp.727-737, 2001.
DOI : 10.1109/CEC.2001.934261

S. Lagraa and H. Seba, An efficient exact algorithm for triangle listing in large graphs, Data Mining and Knowledge Discovery, vol.39, issue.1???3, pp.1-20, 2016.
DOI : 10.1145/1557019.1557111
URL : https://hal.archives-ouvertes.fr/hal-01475515

S. Lagraa, H. Seba, R. Khennoufa, A. Baya, and H. Kheddouci, A distance measure for large graphs based on prime graphs, Pattern Recognition, vol.47, issue.9, pp.472993-3005, 2014.
DOI : 10.1016/j.patcog.2014.03.014
URL : https://hal.archives-ouvertes.fr/hal-01271721

J. Lee, W. Han, R. Kasperovics, L. , and J. , An in-depth comparison of subgraph isomorphism algorithms in graph databases, Proceedings of the 39th international conference on Very Large Data Bases, PVLDB'13, pp.133-144, 2013.
DOI : 10.14778/2535568.2448946

A. Micheli, Neural Network for Graphs: A Contextual Constructive Approach, IEEE Transactions on Neural Networks, vol.20, issue.3, pp.498-511, 2009.
DOI : 10.1109/TNN.2008.2010350

R. Möhring, Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions, Annals of Operations Research, vol.69, issue.1, pp.195-225, 1985.
DOI : 10.1007/BF02022041

R. Möhring, Algorithmic aspects of comparability graphs and interval graphs. I. Rival. Graphs and Order, pp.41-101, 1985.

R. Quaddoura and K. Mansour, Classical graphs decomposition and their totally 2010 decomposable graphs, International Journal of Computer Science and Network Security, vol.10, pp.1240-1250, 2010.

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

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

J. P. Spinrad, Efficient Graph Representation, 2003.
DOI : 10.1090/fim/019

Z. Sun, H. Wang, H. Wang, B. Shao, L. et al., Efficient subgraph matching on billion node graphs, Proceedings of the VLDB Endowment, vol.5, issue.9, pp.788-799, 2012.
DOI : 10.14778/2311906.2311907

M. Tedder, D. G. Corneil, M. Habib, P. , and C. , Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations, Automata, Languages and Programming, 35th International Colloquium Proceedings, Part I: Tack A: Algorithms, Automata , Complexity, and Games, pp.634-645, 2008.
DOI : 10.1007/978-3-540-70575-8_52
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.562.6294

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

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

S. Zhang, S. Li, Y. , and J. , 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, Y. , and P. S. , Graph indexing: Tree + delta >= graph, Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB '07, pp.938-949, 2007.

L. Zou, L. Chen, J. X. Yu, L. , and Y. , A novel spectral coding in a large graph database, Proceedings of the 11th international conference on Extending database technology Advances in database technology, EDBT '08, pp.181-192, 2008.
DOI : 10.1145/1353343.1353369