B. Boden, S. Günnemann, H. Hoffmann, and T. Seidl, Mining coherent subgraphs in multilayer graphs with edge labels, pp.1258-1266, 2012.

F. Bonchi, A. Gionis, F. Gullo, and A. Ukkonen, Distance oracles in edge-labeled graphs, pp.547-558, 2014.

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.7, p.13, 2013.

J. Cheng, Y. Ke, W. Ng, and A. Lu, Fg-index: towards verification-free query processing on graph databases, Sigmod, pp.857-872, 2007.

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.

W. Han, J. Lee, and J. Lee, Turbo iso: towards ultrafast and robust subgraph isomorphism search in large graph databases, Sigmod, pp.337-348, 2013.

H. He and A. K. Singh, Graphs-at-a-time: query language and access methods for graph databases, Sigmod, pp.405-418, 2008.

J. E. Hopcroft and R. M. Karp, An n 5/2 algorithm for maximum matchings in bipartite graphs, SIAM Journal on computing, vol.2, issue.4, pp.225-231, 1973.

J. Lee, W. Han, R. Kasperovics, and J. Lee, An in-depth comparison of subgraph isomorphism algorithms in graph databases, PVLDB, vol.6, issue.2, pp.133-144, 2012.

L. Libkin, J. Reutter, and D. Vrgo?, Trial for rdf: adapting graph query languages for rdf data, Pods, pp.201-212, 2013.

Z. Lin and Y. Bei, Graph indexing for large networks: A neighborhood tree-based approach, Knowledge-Based Systems, vol.72, pp.48-59, 2014.

X. Ren and J. Wang, Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs, vol.8, pp.617-628, 2015.

H. Shang, Y. Zhang, X. Lin, and J. X. Yu, Taming verification hardness: an efficient algorithm for testing subgraph isomorphism, vol.1, pp.364-375, 2008.

L. Tang, X. Wang, and H. Liu, Community detection via heterogeneous interaction analysis, Data Mining and Knowledge Discovery, vol.25, pp.1-33, 2012.

M. Terrovitis, S. Passas, P. Vassiliadis, and T. Sellis, A combination of trie-trees and inverted files for the indexing of set-valued attributes, Cikm, pp.728-737, 2006.

X. Yan, P. S. Yu, and J. Han, Graph indexing: a frequent structure-based approach, Sigmod, pp.335-346, 2004.

A. Zhang, Protein interaction networks: Computational analysis, 2009.

P. Zhao and J. Han, On graph query optimization in large networks, PVLDB, vol.3, issue.1-2, pp.340-351, 2010.

X. Zhao, C. Xiao, X. Lin, W. Wang, and Y. Ishikawa, Efficient processing of graph similarity queries with edit distance constraints, VLDB Journal, vol.22, issue.6, pp.727-752, 2013.