R. Ambauen, S. Fischer, and H. Bunke, Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Identification, IAPR Workshop on Graph-based Representation in Pattern Recognition, pp.95-106
DOI : 10.1007/3-540-45028-9_9

B. Bollobás and A. G. Thomason, Hereditary and monotone properties of graphs, The mathematics of Paul Erdos, II, chapter Algorithms and Combinatorics 14, pp.70-78, 1997.

M. Borowiecki and P. Mihók, Hereditary properties of graphs, Advances in Graph Theory, pp.42-69, 1991.

H. Bunke, On a relation between graph edit distance and maximum common subgraph, Pattern Recognition Letters, vol.18, issue.8, pp.689-694, 1997.
DOI : 10.1016/S0167-8655(97)00060-3

P. Champin and C. Solnon, Measuring the Similarity of Labeled Graphs, ICCBR 2003, LNAI 2689, pp.80-95, 2003.
DOI : 10.1007/3-540-45006-8_9

A. Stephen and . Cook, The complexity of theorem-proving procedures, STOC, pp.151-158, 1971.

D. Diaz, GNU Prolog user's manual, 1999.

S. Gay, S. Soliman, and F. Fages, A graphical method for reducing and relating models in systems biology, Bioinformatics, vol.26, issue.18, pp.575-581, 2010.
DOI : 10.1093/bioinformatics/btq388

URL : https://hal.archives-ouvertes.fr/hal-01431335

P. Hell and J. Nesetril, Graphs and Homomorphisms, 2004.
DOI : 10.1093/acprof:oso/9780198528173.001.0001

R. Hofestädt, A petri net application to model metabolic processes. Systems Analysis Modelling Simulation, pp.113-122, 1994.

J. Larrosa and G. Valiente, Constraint satisfaction algorithms for graph pattern matching, Mathematical Structures in Computer Science, vol.12, issue.04, pp.403-422, 2002.
DOI : 10.1017/S0960129501003577

Y. Vianney-le-clément, C. Deville, and . Solnon, Constraint-Based Graph Matching, 15th International Conference on Principles and Practice of Constraint Programming, pp.274-288, 2009.
DOI : 10.1007/3-540-70659-3_12

L. Lovász, Graph minor theory, Bulletin of the American Mathematical Society, vol.43, issue.01, pp.75-86, 2006.
DOI : 10.1090/S0273-0979-05-01088-8

N. Venkatramana, M. L. Reddy, M. N. Mavrovouniotis, and . Liebman, Petri net representations in metabolic pathways, Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology (ISMB), pp.328-336, 1993.

J. Régin, A filtering algorithm for constraints of difference in CSPs, AAAI 1994, pp.362-367, 1994.

N. Robertson and P. D. Seymour, Graph Minors. XX. Wagner's conjecture, Journal of Combinatorial Theory, Series B, vol.92, issue.2, pp.325-357, 2004.
DOI : 10.1016/j.jctb.2004.08.001

URL : http://doi.org/10.1006/jctb.1996.0059

C. Solnon, AllDifferent-based filtering for subgraph isomorphism, Artificial Intelligence, vol.174, issue.12-13, pp.12-13850, 2010.
DOI : 10.1016/j.artint.2010.05.002

URL : https://hal.archives-ouvertes.fr/hal-01381476

S. Sorlin and C. Solnon, A parametric filtering algorithm for the graph isomorphism problem, Constraints, vol.58, issue.1???3, pp.518-537, 2008.
DOI : 10.1007/s10601-008-9044-1

URL : https://hal.archives-ouvertes.fr/hal-01500328

N. Vikas, Computational Complexity of Graph Compaction, 1997.

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/s10601-009-9074-3

URL : https://hal.archives-ouvertes.fr/hal-01381438