An improved algorithm for matching large graphs, 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp.149-159, 2001. ,
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION, International Journal of Pattern Recognition and Artificial Intelligence, vol.18, issue.03, pp.265-298, 2004. ,
DOI : 10.1142/S0218001404003228
URL : https://hal.archives-ouvertes.fr/hal-01408706
Un code pour les graphes planaires et ses applications, Astérisque, 1975. ,
Topological model for two-dimensional image representation: definition and optimal extraction algorithm, Computer Vision and Image Understanding, vol.93, issue.2, pp.111-154, 2004. ,
DOI : 10.1016/j.cviu.2003.09.001
URL : https://hal.archives-ouvertes.fr/lirmm-00137917
Marked subgraph isomorphism of ordered graphs Optimal quadratic-time isomorphism of ordered graphs Topological models for boundary representation: a comparison with n-dimensional generalized maps, Advances in Pattern Recognition, volume 1451 of LNCSLie91] P. LienhardtLie94] P. Lienhardt. N-dimensional generalized combinatorial maps and cellular quasi-manifolds. International Journal of Computational Geometry and Applications, pp.122-1311273, 1960. ,
Spectral embedding of graphs, Pattern Recognition, vol.36, issue.10, pp.2213-2230, 2003. ,
DOI : 10.1016/S0031-3203(03)00084-0
Practical graph isomorphism, II, Journal of Symbolic Computation, vol.60, pp.45-87, 1981. ,
DOI : 10.1016/j.jsc.2013.09.003
A parametric filtering algorithm for the graph isomorphism problem, Constraints, vol.58, issue.1???3, pp.518-537, 2007. ,
DOI : 10.1007/s10601-008-9044-1
URL : https://hal.archives-ouvertes.fr/hal-01500328
A census of planar maps Filtering for subgraph isomorphism, Proc. 13th Conf. of Principles and Practice of Constraint Programming, pp.249-271, 1963. ,