D. Avis and . Fukuda, Reverse search for enumeration, Discrete Appl Math, vol.65, issue.1, pp.21-46, 1996.

C. Bron and J. Kerbosch, Finding all cliques of an undirected graph (algorithm 457), Commun. ACM, vol.16, issue.9, pp.575-576, 1973.

Y. Cao, T. Jiang, and . Girke, A maximum common substructure-based algorithm for searching and predicting drug-like compounds, Bioinformatics, vol.24, issue.13, pp.366-374, 2008.

S. Cohen, Y. Kimelfeld, and . Sagiv, Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties, J Comput Syst Sci, vol.74, issue.7, pp.1147-1159, 2008.

A. Conte, . Grossi, L. Marino, L. Tattini, and . Versari, A fast algorithm for large common connected induced subgraphs, AlCoB, pp.62-74, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01555996

A. Conte, . Grossi, L. Marino, and . Versari, Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques, ICALP, vol.148, pp.1-148, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01388461

A. Conte, R. Grossi, A. Marino, and L. Versari, Listing Maximal Subgraphs in Strongly Accessible Set Systems, 2018.

A. Droschinsky, . Heinemann, and . Kriege, Enumeration of maximum common subtree isomorphisms with polynomial-delay, ISAAC, pp.81-93, 2014.

H. C. Ehrlich and M. Rarey, Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review, Wiley Interdisciplinary Reviews: Computational Molecular Science, vol.1, issue.1, pp.68-79, 2011.

E. J. Gardiner, P. Artymiuk, and . Willett, Clique-detection algorithms for matching 3-dimensional molecular structures, J Mol Graph Model, vol.15, pp.245-253, 1997.

A. Gupta and N. Nishimura, Finding largest subtrees and smallest supertrees, Algorithmica, vol.21, issue.2, pp.183-210, 1998.

X. Huang, S. Lai, and . Jennings, Maximum common subgraph: some upper bound and lower bound results, BMC Bioinformatics, vol.7, p.6, 2006.

. Koch, Enumerating all connected maximal common subgraphs in two graphs, Theor Comp Sci, vol.250, issue.1, pp.1-30, 2001.

I. Koch, E. Lengauer, and . Wanke, An algorithm for finding maximal common subtopologies in a set of protein structures, J Comp Bio, vol.3, issue.2, pp.289-306, 1996.

E. B. Krissinel and . Henrick, Common subgraph isomorphism detection by backtracking search. Software: Practice and Experience, vol.34, pp.591-607, 2004.

E. L. Lawler, A. Lenstra, and . Kan, Generating all maximal independent sets: NP-hardness and polynomial-time algorithms, SIAM J Comput, vol.9, issue.3, pp.558-565, 1980.

G. Levi, A note on the derivation of maximal common subgraphs of two directed or undirected graphs, CALCOLO, vol.9, issue.4, pp.341-352, 1973.

K. Makino and T. Uno, New algorithms for enumerating all maximal cliques, SWAT, pp.260-272, 2004.

W. H. Suters, Y. Abu-khzam, C. T. Zhang, N. F. Symons, M. A. Samatova et al., A new approach and faster exact methods for the maximum common subgraph problem, Computing and combinatorics, pp.717-727, 2005.

T. Uno, Two general methods to reduce delay and change of enumeration algorithms, 2003.

. Rjp-van-berlo, . Winterbach, . Mjl-de-groot, . Bender, . Pjt-verheijen et al., Efficient calculation of compound similarity based on maximum common subgraphs and its application to prediction of gene transcript levels, Int J Bioinformatics Res Appl, vol.9, issue.4, pp.407-432, 2013.

R. Welling, A performance analysis on maximal common subgraph algorithms, 15th Twente Student Conference on IT, 2011.

Y. Yuan, . Wang, H. Chen, and . Wang, Graph similarity search on large uncertain graph databases, The VLDB Journal, vol.24, issue.2, pp.271-296, 2015.