M. Baatz, Multiresolution segmentation : an optimization approach for high quality multi-scale image segmentation, Journal of Photogrammetry and Remote Sensing, vol.58, issue.3-4, pp.12-23, 2000.

G. Bruce and . Baumgart, Winged edge polyhedron representation, 1972.

S. [. Basak, G. D. Bertelsen, and . Grunwald, Use of graph theoretic parameters in risk assessment of chemicals, <ce :title>Decision Subtances Methodologies for Human Health Risk Assessment of Toxic Substances</ce :title>, pp.1-3239, 1995.
DOI : 10.1016/0378-4274(95)03375-U

]. C. Bfss01a, P. Banderier, G. Flajolet, M. Schaeffer, and . Soria, Random maps, coalescing saddles, singularity analysis, and Airy phenomena Analysis of algorithms, Random Structures Algorithms, vol.19, issue.3-4, pp.194-246, 2000.

]. C. Bfss01b, P. Banderier, G. Flajolet, M. Schaeffer, and . Soria, Random maps, coalescing saddles, singularity analysis, and Airy phenomena Analysis of algorithms, Random Structures Algorithms, vol.19, issue.3-4, pp.194-246, 2000.

B. E. Boser, I. Guyon, and V. Vapnik, A training algorithm for optimal margin classifiers, Proceedings of the fifth annual workshop on Computational learning theory , COLT '92, pp.144-152
DOI : 10.1145/130385.130401

K. M. Borgwardt, C. S. Ong, S. Schönauer, S. V. Vishwanathan, A. J. Smola et al., Protein function prediction via graph kernels, Bioinformatics, vol.21, issue.Suppl 1, 2005.
DOI : 10.1093/bioinformatics/bti1007

H. Bunke and K. Riesen, Recent advances in graph-based pattern recognition with applications in document analysis, Pattern Recognition, vol.44, issue.5, pp.1057-1067, 2011.
DOI : 10.1016/j.patcog.2010.11.015

M. C. Boeres, C. C. Ribeiro, and I. Bloch, A Randomized Heuristic for Scene Recognition by Graph Matching, Celso C. Ribeiro and
DOI : 10.1007/978-3-540-24838-5_8

K. [. Bunke and . Shearer, A graph distance metric based on the maximal common subgraph On a relation between graph edit distance and maximum common subgraph, Pattern Recognition Letters Pattern Recognition Letters, vol.19, issue.18, pp.3-4255, 1997.

[. Balas and C. S. Yu, Finding a Maximum Clique in an Arbitrary Graph, SIAM Journal on Computing, vol.15, issue.4, pp.1054-1068, 1986.
DOI : 10.1137/0215075

[. Combier, G. Damiand, and C. Solnon, Measuring the Distance of Generalized Maps, Workshop on Graphbased Representations in Pattern Recognition, pp.82-91, 2011.
DOI : 10.1007/978-3-642-20844-7_9
URL : https://hal.archives-ouvertes.fr/hal-00595088

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

R. Fan and . Chung, Spectral Graph Theory, 1997.

P. Olivier-chapelle, V. Haffner, and . Vapnik, Support vector machines for histogram-based image classification, IEEE Transactions on Neural Networks, vol.10, issue.5, pp.1055-1064, 1999.
DOI : 10.1109/72.788646

[. Cie, A method of predicting corresponding colours under different chromatic and illuminance adaptations, 1994.

R. Cori, Un code pour les graphes planaires et ses applications, 1973.

P. Champin and C. Solnon, Measuring the Similarity of Labeled Graphs, Proceedings of the 5th international conference on Case-based reasoning : Research and Development, ICCBR'03, pp.80-95, 2003.
DOI : 10.1007/3-540-45006-8_9

]. G. Dam08 and . Damiand, Topological model for 3d image representation : Definition and incremental extraction algorithm, Computer Vision and Image Understanding, vol.109, issue.3, pp.260-289, 2008.

Y. [. Damiand, C. Bertrand, and . Fiorio, 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

A. Dupas and G. Damiand, First Results for 3D Image Segmentation with??Topological??Map, Coeurjolly et al. [CSTD08], pp.507-518
DOI : 10.1007/978-3-540-79126-3_45
URL : https://hal.archives-ouvertes.fr/hal-00305485

G. Damiand, C. De-la-higuera, J. Janodet, E. Samuel, C. Solnon et al., A Polynomial Algorithm for Submap Isomorphism, Boltzmann samplers for the random generation of combinatorial structures. Combinatorics, Probability and Computing, pp.102-112, 2004.
DOI : 10.1007/978-3-540-74970-7_51

G. Damiand and P. Lienhardt, Removal and Contraction for n-Dimensional Generalized Maps, Nyström et al. [NdBS03], pp.408-419
DOI : 10.1007/978-3-540-39966-7_39

J. [. De-la-higuera, E. Janodet, G. Samuel, C. Damiand, and . Solnon, Polynomial algorithms for open planar graph and subgraph isomorphism

R. Pasari, P. A. Durand, K. Darrasse, O. Panagiotou, M. Roussel et al., An efficient algorithm for similarity analysis of molecules Boltzmann generation for regular languages with shuffle. in preparation for Gascom'10, Internet Journal of Chemistry, 1999.

G. Damiand and P. Resch, Topological Map Based Algorithms for 3D Image Segmentation, Braquelaire et al. [BLV02], pp.220-231
DOI : 10.1007/3-540-45986-3_20

G. Damiand, C. Solnon, C. De-la-higuera, J. Janodet, and E. Samuel, Polynomial algorithms for subisomorphism of nD open combinatorial maps, Computer Vision and Image Understanding, vol.115, issue.7, pp.996-1010, 1960.
DOI : 10.1016/j.cviu.2010.12.013
URL : https://hal.archives-ouvertes.fr/hal-00597483

D. Eppsteinffp07, ]. P. Flajolet, É. Fusy, and C. Pivoteau, Subgraph isomorphism in planar graphs and related problems Boltzmann sampling of unlabelled structures, Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, SODA '95 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics Proceedings of the New Orleans Conference, pp.632-640, 1995.

G. William-flake, S. Lawrence, and C. Giles, Efficient identification of web communities, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '00, pp.150-160, 2000.

R. [. Flajolet and . Sedgewick, Analytic combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

[. Fernández and G. Valiente, A graph distance metric combining maximum common subgraph and minimum common supergraph, Pattern Recognition Letters, vol.22, issue.6-7, pp.753-758, 2001.
DOI : 10.1016/S0167-8655(01)00017-4

[. Gauzere, L. Brun, and D. Villemin, Two New Graph Kernels and Applications to Chemoinformatics, 8th IAPR -TC-15 Workshop on Graph-based Representations in Pattern Recognition (GBR'11), pp.112-122, 2011.
DOI : 10.1007/978-3-642-20844-7_12
URL : https://hal.archives-ouvertes.fr/hal-00596506

[. Gosselin, G. Damiand, and C. Solnon, Frequent Submap Discovery, 22nd Annual Symposium on Combinatorial Pattern Matching (CPM2011), pp.429-440, 2011.
DOI : 10.4153/CJM-1963-029-x
URL : https://hal.archives-ouvertes.fr/hal-00636373

[. Gärtner, P. Flach, and S. Wrobel, On Graph Kernels: Hardness Results and Efficient Alternatives, Learning Theory and Kernel Machines, pp.129-143978, 1007.
DOI : 10.1007/978-3-540-45167-9_11

D. [. Garey and . Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness, 1979.

S. Gosselin, Recherche de motifs fréquents dans une base de cartes combinatoires, Thèse de doctorat en informatique, 2011.

L. Guibas and J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi, ACM Transactions on Graphics, vol.4, issue.2, pp.74-123, 1985.
DOI : 10.1145/282918.282923

A. [. Kashima, A. Inokuchi, and . Inokuchi, Kernels for graph classification, 2002.

D. Haussler, Convolution kernels on discrete structures, 1999.

G. [. Horna, D. Damiand, Y. Meneveaux, and . Bertrand, Building 3d indoor scenes topology from 2d architectural plans, Proc. of 2nd International Conference on Computer Graphics Theory and Applications (GRAPP), pp.37-44, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00337793

D. [. Horna, G. Meneveaux, Y. Damiand, and . Bertrand, Consistency constraints and 3D building reconstruction, Computer-Aided Design, vol.41, issue.1, pp.13-27, 2009.
DOI : 10.1016/j.cad.2008.11.006
URL : https://hal.archives-ouvertes.fr/hal-00440844

J. [. Hopcroft and . Wong, Linear time algorithm for isomorphism of planar graphs (Preliminary Report), Proceedings of the sixth annual ACM symposium on Theory of computing , STOC '74, pp.172-184, 1974.
DOI : 10.1145/800119.803896

D. Justice and A. Hero, A binary linear programming formulation of the graph edit distance, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.28, issue.8, pp.1200-1214, 2006.
DOI : 10.1109/TPAMI.2006.152

R. Imre, K. , and J. D. Lafferty, Diffusion kernels on graphs and other discrete input spaces, Proceedings of the Nineteenth International Conference on Machine Learning, ICML '02, pp.315-322, 2002.

]. D. Knu97 and . Knuth, The Art of Computer Programming : Fundamental Algorithms, 1997.

[. Kisku, A. Rattani, E. Grosso, and M. Tistarelli, Face Identification by SIFT-based Complete Graph Topology, 2007 IEEE Workshop on Automatic Identification Advanced Technologies, p.6, 2007.
DOI : 10.1109/AUTOID.2007.380594

J. Kandola, J. Shawe-taylor, and N. Cristianini, Learning semantic similarity, NIPS, pp.657-664, 2003.

H. Kashima, K. Tsuda, and A. Inokuchi, Marginalized kernels between labeled graphs, Fawcett and Mishra [FM03], pp.321-328

[. Levenshtein, Binary codes capable of correcting spurious insertions and deletions of ones, Problems of Information Transmission, vol.1, issue.1, pp.8-17, 1965.

P. Lienhardt, Topological models for boundary representation: a comparison with n-dimensional generalized maps, Computer-Aided Design, vol.23, issue.11, pp.59-82, 1991.
DOI : 10.1016/0010-4485(91)90100-B

]. P. Lie94 and . Lienhardt, N-dimensional generalized combinatorial maps and cellular quasi-manifolds, International Journal of Computational Geometry and Applications, vol.4, issue.3, pp.275-324, 1994.

G. [. Lewis and . Knowles, Image compression using the 2-D wavelet transform, IEEE Transactions on Image Processing, vol.1, issue.2, pp.244-250, 1992.
DOI : 10.1109/83.136601

J. Lladoós, E. Martí, and J. Villanueva, Symbol recognition by error-tolerant subgraph matching between region adjacency graphs, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.23, issue.10, pp.1137-1143, 2001.
DOI : 10.1109/34.954603

]. B. Lsg-+-12, T. Li, A. Schreck, M. Godil, T. Alexa et al., Shrec'12 track : Sketch-based 3d shape retrieval, Spagnuolo et al. [SBBF12], pp.109-118

[. Luo, R. C. Wilson, and E. R. Hancock, Spectral embedding of graphs, Pattern Recognition, vol.36, issue.10, pp.2213-2230, 2003.
DOI : 10.1016/S0031-3203(03)00084-0

[. Luo, R. C. Wilson, E. R. Hancock, and E. R. Hancock, Spectral embedding of graphs, Pattern Recognition, vol.36, issue.10, pp.2213-2230, 2003.
DOI : 10.1016/S0031-3203(03)00084-0

S. G. Mallat, A theory for multiresolution signal decomposition: the wavelet representation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.11, issue.7, pp.674-693, 1989.
DOI : 10.1109/34.192463

]. M. Man88 and . Mantyla, Introduction to Solid Modeling, 1988.

J. J. Mcgregor, Backtrack search algorithms and the maximal common subgraph problem. Software Practice and Experience, pp.23-34, 1982.

B. D. Mckay, Graph isomorphism

]. J. Mer09 and . Mercer, Functions of positive and negative type and their connection with the theory of integral equations, Philos. Trans. Royal Soc. (A), vol.83, issue.559, pp.69-70, 1909.

G. Paul and . Mezey, Graph representations of molecular similarity measures based on topological resolution, J. Comp. Methods in Sci. and Eng, vol.5, pp.109-114, 2005.

N. [. Milenkovic and . Przulj, Uncovering Biological Network Function via Graphlet Degree Signatures. arXiv, q-bio, 2008.

J. R. Munkres, Algorithms for the Assignment and Transportation Problems, Journal of the Society for Industrial and Applied Mathematics, vol.5, issue.1, pp.32-38, 1957.
DOI : 10.1137/0105003

. Nil82, . J. Nils, and . Nilsson, Principles of Artificial Intelligence [NS11] Samba Ndojh Ndiaye and Christine Solnon. Cp models for maximum common subgraph problems, Lee [Lee11], pp.637-644, 1982.

[. Ohlander, K. Price, and D. R. Reddy, Picture segmentation using a recursive region splitting method, Computer Graphics and Image Processing, vol.8, issue.3, pp.313-333, 1978.
DOI : 10.1016/0146-664X(78)90060-6

W. Peterson and D. Brown, Cyclic Codes for Error Detection, Proceedings of the IRE, vol.49, issue.1, pp.228-235, 1961.
DOI : 10.1109/JRPROC.1961.287814

[. Page, S. Brin, R. Motwani, and T. Winograd, The pagerank citation ranking : Bringing order to the web, 1999.

[. Pekalska and R. P. Duin, The Dissimilarity Representation for Pattern Recognition : Foundations And Applications (Machine Perception and Artificial Intelligence), 2005.
DOI : 10.1142/5965

J. W. Raymond, Peter Willett 0002, and Peter Willett 0002. Maximum common subgraph isomorphism algorithms for the matching of chemical structures, pp.521-533, 2002.

[. Raghavan, Graph Structure of the Web: A Survey, Gonnet et al. [GPV00], pp.123-125
DOI : 10.1007/10719839_13

K. Riesen and H. Bunke, Approximate graph edit distance computation by means of bipartite graph matching, Image and Vision Computing, vol.27, issue.7, pp.950-959, 2009.
DOI : 10.1016/j.imavis.2008.04.004

L. [. Robinson and . Foulds, Comparison of phylogenetic trees, Mathematical Biosciences, vol.53, issue.1-2, pp.131-147, 1981.
DOI : 10.1016/0025-5564(81)90043-2

J. Raymond, E. J. Gardiner, and P. Willett, RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs, The Computer Journal, vol.45, issue.6, pp.631-644, 2002.
DOI : 10.1093/comjnl/45.6.631

A. Robles-kelly and E. R. Hancock, A Riemannian approach to graph embedding, Pattern Recognition, vol.40, issue.3, pp.1042-1056, 2007.
DOI : 10.1016/j.patcog.2006.05.031

M. [. Roussel and . Soria, Boltzmann sampling of ordered structures, LAGOS'09 -V Latin-American Algorithms, Graphs and Optimization Symposium, pp.305-310, 2009.
DOI : 10.1016/j.endm.2009.11.050
URL : https://hal.archives-ouvertes.fr/hal-01294656

G. [. Simon, P. Damiand, and . Lienhardt, D generalized map pyramids: Definition, representations and basic operations, Pattern Recognition, vol.39, issue.4, pp.527-538, 2006.
DOI : 10.1016/j.patcog.2005.10.004

A. Suga, K. Fukuda, T. Takiguchi, and Y. Ariki, Object recognition and segmentation using sift and graph cuts, 19th International Conference on Pattern Recognition, pp.1-4, 2008.

M. Sonka, V. Hlavac, and R. Boyle, Image Processing, Analysis, and Machine Vision. Thomson-Engineering, 2007.

M. [. Silverman, . E. Jones, J. L. Fix, and . Hodges, An Important Contribution to Nonparametric Discriminant Analysis and Density Estimation : Commentary on Fix and Hodges (1951), International Statistical Review / Revue Internationale de Statistique, vol.57, issue.3, pp.233-238, 1951.

C. Solnon and J. Jolion, Generalized vs Set Median Strings for Histogram-Based Distances: Algorithms and Classification Results in the Image Domain, Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition, GbRPR'07, pp.404-414, 2007.
DOI : 10.1007/978-3-540-72903-7_37
URL : https://hal.archives-ouvertes.fr/hal-01501826

B. Spillmann, M. Neuhaus, H. Bunke, E. , and R. P. Duin, Transforming Strings to Vector Spaces Using Prototype Selection, Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition, SS- PR'06/SPR'06, pp.287-296, 2006.
DOI : 10.1007/11815921_31

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

[. Sorlin and C. Solnon, Reactive Tabu Search for Measuring Graph Similarity, 2004.
DOI : 10.1007/978-3-540-31988-7_16

[. Sorlin and C. Solnon, Reactive Tabu Search for Measuring Graph Similarity, Brun and Vento [BV05], pp.172-182
DOI : 10.1007/978-3-540-31988-7_16

[. Sammoud, C. Solnon, and K. Ghédira, Ant Algorithm for the Graph Matching Problem, Evolutionary Computation in Combinatorial Optimization Lecture Notes in Computer Science, vol.3448, issue.10, pp.213-223978, 1007.
DOI : 10.1007/978-3-540-31996-2_20

[. Sammoud, S. Sorlin, C. Solnon, and K. Ghédira, A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems, Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization, Evo- COP'06, pp.234-246, 2006.
DOI : 10.1007/11730095_20

S. V. Svp-+-09-]-nino-shervashidze, T. Vishwanathan, K. Petri, K. M. Mehlhorn, K. M. Borgwardt et al., Efficient graphlet kernels for large graph comparison, pp.488-495, 2009.

[. Sharma, W. Wu, and E. N. Dalal, The CIEDE2000 color-difference formula: Implementation notes, supplementary test data, and mathematical observations, Color Research & Application, vol.6, issue.1, pp.21-30
DOI : 10.1002/col.20070

. Sys82, M. Maciej, and . Sys?o, The subgraph isomorphism problem for outerplanar graphs, Theoretical Computer Science, vol.17, issue.1, pp.91-97, 1982.

S. Warren and . Torgerson, Theory and methods of scaling

[. Takahashi, M. Sukekawa, and S. Sasaki, Automatic identification of molecular similarity using reduced-graph representation of chemical structure, Journal of Chemical Information and Modeling, vol.32, issue.6, pp.639-643, 1992.
DOI : 10.1021/ci00010a009

]. J. Ull76 and . Ullmann, An algorithm for subgraph isomorphism, J. ACM, vol.23, issue.1, pp.31-42, 1976.

[. Vapnik, Statistical learning theory, 1998.

M. Vidal-naquet and S. Ullman, Object recognition with informative features and linear classification, Proceedings Ninth IEEE International Conference on Computer Vision, p.281, 2003.
DOI : 10.1109/ICCV.2003.1238356

C. Watkins, Dynamic alignment kernels, Advances in Large Margin Classifiers, pp.39-50, 1999.

G. Wang, B. Dai, D. Ni, F. Xu, and . Siewe, A distance measure between labeled combinatorial maps, Computer Vision and Image Understanding, vol.116, issue.12, p.2012
DOI : 10.1016/j.cviu.2012.08.002

. Rosenfeld, multiresolution image processing and analysis. berlinheidelberg-new york-tokyo, springer-verlag 1984. viii, 385 s., 198 abb., dm 75,?. us $ 28.00. isbn 3-540-13006-3 (springer-series in information sciences 12, ZAMM -Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, pp.65274-274, 1985.

[. 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