P. Sketch-of-lemma-3 and .. , Iterative Local Global Filtering Algorithm (ILGF), p.89

C. Nabti and H. Seba, Querying massive graph data: A compress and search approach, Future Generation Computer Systems, vol.74, pp.63-75, 2017.
DOI : 10.1016/j.future.2017.04.005
URL : https://hal.archives-ouvertes.fr/hal-01546073

C. Nabti and H. Seba, Subgraph Isomorphism Search in Massive Graph Databases, Proceedings of the International Conference on Internet of Things and Big Data, p.1313922
DOI : 10.5220/0005875002040213
URL : https://hal.archives-ouvertes.fr/hal-01313922

C. Nabti and H. Seba, Querying Massive Graph Data: a Compress and Search Approach Best Presentation Award, High Quality Journals Forum, 2017.
DOI : 10.1016/j.future.2017.04.005

C. Nabti and H. Seba, Compact Neighborhood Index for Subgraph Queries in Massive Graphs. A preliminarily version is available in Arxiv https

M. Adler and M. Mitzenmacher, Towards compressing Web graphs, Proceedings DCC 2001. Data Compression Conference, 2001.
DOI : 10.1109/DCC.2001.917151
URL : https://dash.harvard.edu/bitstream/handle/1/24829611/tr-08-00.pdf?sequence=1

A. V. Aho, M. R. Garey, and J. D. Ullman, The Transitive Reduction of a Directed Graph, SIAM Journal on Computing, vol.1, issue.2, pp.131-137, 1972.
DOI : 10.1137/0201008

C. Boanerges-aleman-meza, S. Halaschek-wiener, A. Sanket-sahoo, . Sheth, and . Arpinar, Template based semantic similarity for security applications, International Conference on Intelligence and Security Informatics, pp.621-622, 2005.

E. Bengoetxea, Inexact Graph Matching Using Estimation of Distribution Algorithms, 2002.

F. Bi, L. Chang, X. Lin, L. Qin, and W. Zhang, Efficient Subgraph Matching by Postponing Cartesian Products, Proceedings of the 2016 International Conference on Management of Data, SIGMOD '16, pp.1199-1214, 2016.
DOI : 10.1145/1353343.1353369

P. Boldi and S. Vigna, The webgraph framework I, Proceedings of the 13th conference on World Wide Web , WWW '04, pp.595-602, 2004.
DOI : 10.1145/988672.988752

V. Bonnici, R. Giugno, A. Pulvirenti, D. Shasha, and A. Ferro, A subgraph isomorphism algorithm and its application to biochemical data, BMC Bioinformatics, vol.14, issue.Suppl 7, p.2013
DOI : 10.1093/nar/gkq973
URL : https://bmcbioinformatics.biomedcentral.com/track/pdf/10.1186/1471-2105-14-S7-S13?site=bmcbioinformatics.biomedcentral.com

P. Buneman, M. Grohe, and C. Koch, Path Queries on Compressed XML, Proceedings of the 29th International Conference on Very Large Data Bases, pp.141-152, 2003.
DOI : 10.1016/B978-012722442-8/50021-5
URL : http://www.dbai.tuwien.ac.at/staff/koch/download/vldb2003_bgk.pdf

C. Capelle, M. Habib, and F. De-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

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

P. Luigi, P. Cordella, C. Foggia, M. Sansone, and . Vento, Performance evaluation of the vf graph matching algorithm, Image Analysis and Processing Proceedings. International Conference on, pp.1172-1177, 1999.

W. Fan and J. Huai, Querying Big Data: Bridging Theory and Practice, Journal of Computer Science and Technology, vol.26, issue.6, pp.849-869, 2014.
DOI : 10.1016/j.tcs.2013.11.002

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
DOI : 10.1145/2213836.2213855

T. Gallai, Transitiv orientierbare Graphen, Acta Mathematica Academiae Scientiarum Hungaricae, vol.51, issue.1-2, pp.25-66, 1967.
DOI : 10.4153/CJM-1964-055-5

M. R. , G. , D. S. Johnson, S. Greenblatt, T. Marcus et al., Computers and Intractability: A Guide to the Theory of NP-Completeness Tmods-integrated fusion dashboardapplying fusion of fusion systems to counter-terrorism, Proc. International Conference on Intelligence Analysis, 1979.

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

M. Habib, F. De-montgolfier, and C. Paul, A simple lineartime modular decomposition algorithm for graphs, Scandinavian Workshop on Algorithm Theory -SWAT, pp.187-198, 2004.
DOI : 10.1007/978-3-540-27810-8_17
URL : https://hal.archives-ouvertes.fr/hal-00159601

J. Wook-shin-han, J. Lee, and . Lee, Turboiso: Towards Ultrafast and Robust Subgraph Isomorphism Search in Large Graph Databases, Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, SIGMOD '13, pp.337-348, 2013.

J. Wook-shin-han, J. Lee, and . Lee, Turboiso: Towards ultrafast and robust subgraph isomorphism search in large graph databases, Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, SIGMOD '13, pp.337-348, 2013.

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

T. Harry and . Hsu, An algorithm for finding a minimal equivalent graph of a digraph, J. ACM, vol.22, issue.1, pp.11-16, 1975.

S. Jayaraman, Fg-index: Towards verification-free query processing on graph databases, 2013.

E. Donald and . Knuth, Estimating the efficiency of backtrack programs, Mathematics of computation, vol.29, issue.129, pp.122-136, 1975.

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, M. Abir, H. Baya et al., A distance measure for large graphs based on prime graphs, Pattern Recognition, vol.47, issue.9, pp.2993-3005, 2014.
DOI : 10.1016/j.patcog.2014.03.014
URL : https://hal.archives-ouvertes.fr/hal-01271721

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, pp.133-144, 2012.
DOI : 10.14778/2535568.2448946

J. Lee, W. Han, R. Kasperovics, and J. Lee, 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

J. Leskovec, K. Lang, A. Dasgupta, and M. Mahoney, Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters, Internet Mathematics, vol.6, issue.1, pp.29-12329, 2009.
DOI : 10.1080/15427951.2009.10129177

J. Leskovec, D. Huttenlocher, and J. Kleinberg, Predicting positive and negative links in online social networks, Proceedings of the 19th international conference on World wide web, WWW '10, pp.641-650, 2010.
DOI : 10.1145/1772690.1772756
URL : http://www.cs.cornell.edu/Info/People/kleinber/www10-signed.pdf

J. Leskovec, J. Kleinberg, and C. Faloutsos, Graphs over time, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining , KDD '05, pp.177-187, 2005.
DOI : 10.1145/1081870.1081893

H. Maserrat and J. Pei, Neighbor query friendly compression of social networks, Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '10, pp.533-542, 2010.
DOI : 10.1145/1835804.1835873

D. Brendan, A. Mckay, and . Piperno, Practical graph isomorphism, II. CoRR, abs/1301.1493, 2013. REFERENCES [39] Ryan Boyd William Lyon Michael Hunger. Rdbms graphs: Sql vs. cypher query languages. https, 2015.

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

K. H. Randall, R. Stata, R. G. Wickremesinghe, and J. L. Wiener, The Link Database: fast access to graphs of the Web, Proceedings DCC 2002. Data Compression Conference, pp.122-131, 2002.
DOI : 10.1109/DCC.2002.999950

X. Ren and J. Wang, Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs, Proc. VLDB Endow, pp.617-628, 2015.
DOI : 10.14778/2735479.2735493
URL : http://www.vldb.org/pvldb/vol8/p617-ren.pdf

H. Seba, S. Lagraa, and E. Ronando, Comparison issues in large graphs: State of the art and future directions, 1502.

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

Z. Sun, H. Wang, H. Wang, B. Shao, and J. Li, 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
URL : http://vldb.org/pvldb/vol5/p788_zhaosun_vldb2012.pdf

L. Takac and M. Zabovsky, Data analysis in public social networks, International Scientific Conference and International Workshop Present Day Trends of Innovations, 2012.

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

J. Sebastiaan, . Van-schaik, and . Oege-de-moor, A memory efficient reachability data structure through bit vector compression, Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, pp.913-924, 2011.

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

J. Yang and J. Leskovec, Defining and evaluating network communities based on ground-truth, Knowledge and Information Systems, vol.393, issue.3, pp.181-213, 2015.
DOI : 10.1145/2501654.2501657

T. Safavi, D. Koutra, A. Liu, and . Dighe, Graph summarization: A survey, ACM Computing Surveys, 2017.

B. Yirka, Computer scientist claims to have solved the graph isomorphism problem. https : / / phys . org / news / 2015-11-scientist-graph-isomorphism-problem, 2016.

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, Proc. VLDB Endow, pp.340-351, 2010.
DOI : 10.14778/1920841.1920887
URL : http://www.comp.nus.edu.sg/%7Evldb2010/proceedings/files/papers/R30.pdf

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
URL : http://www.comp.nus.edu.sg/%7Evldb2010/proceedings/files/papers/R30.pdf

P. Zhao, J. X. Yu, and P. S. Yu, Graph indexing: Tree + delta graph, Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB '07, pp.938-949, 2007.

X. Zhao, C. Xiao, X. Lin, and W. Wang, Efficient Graph Similarity Joins with Edit Distance Constraints, 2012 IEEE 28th International Conference on Data Engineering, pp.1-5, 2012.
DOI : 10.1109/ICDE.2012.91
URL : http://www.cse.unsw.edu.au/~weiw/files/ICDE12-GraphEdJoin-Final.pdf

G. Zhu, X. Lin, K. Zhu, W. Zhang, J. Xu et al., Treespan Efficiently computing similarity all-matching, Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, SIGMOD '12, pp.529-540

L. Zou, L. Chen, J. X. Yu, and Y. Lu, 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