. La-suite-de-sommets, 1, 3) du graphe de la gure 2.1(c) constitue une chaîne, La chaîne, vol.3, issue.1 2

C. Berge, Théorie des Graphes et ses Applications, 1958.

J. R. Ullman, An Algorithm for Subgraph Isomorphism, Journal of the ACM, vol.23, issue.1, p.3142, 1976.
DOI : 10.1145/321921.321925

D. E. Ghahraman, A. K. Wong, and T. Au, Graph monomorphism algorithms, IEEE Transaction on System, Man and Cybernetics, vol.10, p.189197, 1980.
DOI : 10.1109/tsmc.1980.4308468

L. P. Cordella, P. Foggia, C. Sansone, F. Tortorella, and M. Vento, Graph matching: a fast algorithm and its evaluation, Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170), p.15821584, 1998.
DOI : 10.1109/ICPR.1998.712014

L. Cordella, P. Foggia, C. Sansone, and M. Vento, Subgraph Transformations for the Inexact Matching of Attributed Relational Graphs, International journal of Computing, vol.12, p.4352, 1998.
DOI : 10.1007/978-3-7091-6487-7_5

L. P. Cordella, P. Foggia, C. Sansone, and M. Vento, An improved algorithm for matching large graphs, IAPR-TC15 Workshop p, Graph-Based Representations in Pattern Recognition, p.149159, 2001.

A. R. , S. Fischer, and H. Bunke, Graph edit distance with node splitting and merging, and its application to diatom identication, IAPR-TC15 Workshopp on Graph-based Representation in Pattern Recognition, p.95106, 2003.

M. Neuhaus, K. Riesen, and H. Bunke, Fast Suboptimal Algorithms for the Computation of Graph Edit Distance, SSPR/SPR, p.163172, 2006.
DOI : 10.1007/11815921_17

K. Riesen, M. Neuhaus, and H. Bunke, Bipartite Graph Matching for Computing the Edit Distance of Graphs, 2007.
DOI : 10.1007/978-3-540-72903-7_1

P. M. Pardalos, J. Rappe, M. G. Mauricio, and . Resende, An Exact Parallel Algorithm for the Maximum Clique Problem, High Performance and Software in Nonlinear Optimization, p.279300, 1998.
DOI : 10.1007/978-1-4613-3279-4_18

Y. Shinano, T. Fujie, Y. Ikebe, and R. Hirabayashi, Solving the maximum clique problem using PUBB, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, p.326332, 1998.
DOI : 10.1109/IPPS.1998.669935

B. Mckay, Practical graph isomorphism, II, Journal of Symbolic Computation, vol.60, p.4587, 1981.
DOI : 10.1016/j.jsc.2013.09.003

B. Messmer, Ecient graph matching algorithm for preprocessed model graphs, 1995.

B. T. Messmer and H. Bunke, Ecient subgraph isomorphism detection : a decomposition approach, IEEE Transaction on Knowlegde and Data Engineering, p.307323, 2000.

C. Irniger and H. Bunke, Graph matching : ltering large databases of graphs using decision trees, IAPR-TC15 Workshop Graph-Based Representations in Pattern Recognition, p.239249, 2001.

W. H. Tsai and K. S. Fu, Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis, IEEE Transactions on Systems, Man, and Cybernetics, vol.9, issue.12, p.757768, 1979.
DOI : 10.1109/TSMC.1979.4310127

H. Bunke and X. Jiang, Graph matching and similarity, in Intelligent Systems and Interfaces, ser. International series in intelligent technologies, p.281301, 2000.

T. Gärtner, K. Driessens, and J. Ramon, Graph Kernels and Gaussian Processes for Relational Reinforcement Learning, ILP, p.146163, 2003.
DOI : 10.1007/978-3-540-39917-9_11

. Reiber, Consistent inexact graph matching applied to labelling coronary segments in arteriograms, IEEE International Conference on Pattern Recognition, p.439442, 1992.

S. Berretti, A. D. Bimbo, and E. Vicario, Ecient matching and indexing of graph models in content-based retrieval, IEEE Trans. on PAMI, vol.23, issue.10, p.10891105, 2001.

L. Gregory and J. Kittler, Using Graph Search Techniques for Contextual Colour Retrieval, IAPR International Workshops on SSPR and SPR, pp.186-194, 2002.
DOI : 10.1007/3-540-70659-3_19

R. Allen, L. Cinque, S. Tanimoto, L. G. Shapiro, and D. Yasuda, A parallel algorithm for graph matching and its maspar implementation, IEEE Transactions on Parallel and Distributed Systems, vol.8, p.490501, 1997.

S. Umeyama, An eigendecomposition approach to weighted graph matching problems, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.10, issue.5, p.695703, 1988.
DOI : 10.1109/34.6778

L. Xu and I. King, A pca approach for fast retrieval of structural patterns in attributed graphs, IEEE Transactions on Systems, Man and Cybernetics, vol.31, p.812817, 2001.

]. M. Bibliographie26, E. R. Carcassoni, and . Hancock, Weighted graph-matching using modal clusters, IAPR-TC15 Workshop Graph-Based Representations in Pattern Recognition, p.260269, 2001.

S. Kosinov and T. Caelli, Inexact Multisubgraph Matching Using Graph Eigenspace and Clustering Models, IAPR International Workshops on SSPR and SPR, p.133142, 2002.
DOI : 10.1007/3-540-70659-3_13

M. Leordeanu and M. Hebert, A spectral technique for correspondence problems using pairwise constraints, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1, p.14821489, 2005.
DOI : 10.1109/ICCV.2005.20

A. C. Berg, T. L. Berg, and J. Malik, Shape Matching and Object Recognition Using Low Distortion Correspondences, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05), p.2633, 2005.
DOI : 10.1109/CVPR.2005.320

Y. Zheng and D. Doermann, Robust point matching for nonrigid shapes by preserving local neighborhood structures, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.28, issue.4, p.643, 2006.
DOI : 10.1109/TPAMI.2006.81

O. Duchenne, F. Bach, I. Kweon, and J. Ponce, A tensor-based algorithm for highorder graph matching, IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), 2009.
URL : https://hal.archives-ouvertes.fr/hal-01063322

B. T. Messmer and H. Bunke, A new algorithm for error-tolerant subgraph isomorphism detection, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.20, issue.5, p.493504, 1998.
DOI : 10.1109/34.682179

F. Fuchs and H. L. Men, Building reconstruction on aerial images through multiprimitive graph matching, IAPR-TC15 Workshop Graph-Based Representations in Pattern Recognition, p.2130, 1999.

P. N. Suganthan, Attributed relational graph matching by neural-gas networks, Neural Networks for Signal Processing X. Proceedings of the 2000 IEEE Signal Processing Society Workshop (Cat. No.00TH8501), p.366374, 2000.
DOI : 10.1109/NNSP.2000.889428

C. W. Liu, K. C. Fan, J. T. Horng, and Y. K. Wang, Solving weighted graph matching problem by modied microgenetic algorithm, IEEE International Conference on Systems, Man and Cybernetics, p.638643, 1995.

A. Perchant, C. Boeres, I. Bloch, M. Roux, and C. Ribeiro, Model-based scene recognition using graph fuzzy homomorphism solved by genetic algorithm, IAPR-TC15 Workshop Graph-Based Representations in Pattern Recognition, p.6170, 1999.

K. G. Khoo and P. N. Suganthan, Multiple relational graphs mapping using genetic algorithms, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546), p.727733, 2001.
DOI : 10.1109/CEC.2001.934261

O. Sammoud, S. Sorlin, C. Solnon, and K. Ghedira, A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems, 6th European Conference on Evolutionary Computation in Combinatorial Optimization, p.287301, 2006.
DOI : 10.1007/11730095_20

A. Hlaoui and S. Wang, A New Algorithm for Graph Matching with Application to Content-Based Image Retrieval, IAPR International Workshops on SSPR and SPR, p.291300, 2002.
DOI : 10.1007/3-540-70659-3_30

S. Kirkpatrick, J. Gelatt, and M. Vecchi, Optimisation by simulated annealing, Science, vol.220, p.671680, 1983.

B. Selman, H. Levesque, and D. Mitchell, A new method for solving hard satisability problems, National Conference on Articial Intelligence, p.440446, 1992.

F. Glover, Tabu search, Journal on Computing, 1989.
URL : https://hal.archives-ouvertes.fr/hal-01389283

S. Sorlin, O. Sammoud, C. Solnon, and K. Ghedira, Etude comparative de aco et de tabou réactif sur des problémes d'appariement de graphes, 2èmes Journées Francophones de Programmation par Contraintes (JFPC'06), pp.317-326, 2006.

T. Gärtner, P. Flach, and S. Wrobel, Graph Kernels, Proceedings of the 16th Annual Conference on Computational Learning Theory and the 7th Kernel Workshop, 2003.
DOI : 10.1142/9789812814562_0005

H. Kashima and Y. Tsuboi, Marginalized kernels between labeled graphs, International Conference on Machine Learning (ICML), p.321328, 2003.

Z. Harchaoui and F. Bach, Image classication with segmentation graph kernels, International Conference on Computer Vision and Pattern Recognition, 2007.

V. Vapnik, Statistical Learning Theory, 1998.

A. Smola, P. Barlett, B. Scholkopf, and C. Schuurmans, Advances in Large Margin Classiers, 2000.

J. Shawe-taylor and N. Cristianini, Kernel methods for Pattern Analysis, 2004.
DOI : 10.1017/CBO9780511809682

C. Wallraven, B. Caputo, and A. Graf, Recognition with local features: the kernel recipe, Proceedings Ninth IEEE International Conference on Computer Vision, p.257264, 2003.
DOI : 10.1109/ICCV.2003.1238351

S. Lyu, Mercer kernels for object recognition with local features, IEEE International Conference on Computer Vision and Pattern Recognition, 2005.

B. Haasdonk, Feature space interpretation of svms with indenite kernels, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.27, issue.4, p.482492, 2005.

B. Haasdonk and E. Pekalska, Indenite kernel sher discriminant, Int. Conf. on Pattern Recognition (ICPR), p.14, 2008.

. Bibliographie, Convolution kernels on discrete structures, Institute of California at Santa Cruz, Tech. Rep, 1999.

T. Gärtner, A survey of kernels for structured data, SIGKDD Explorations, p.4958, 2003.
DOI : 10.1145/959242.959248

H. Kashima and Y. Tsuboi, Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs, Twenty-first international conference on Machine learning , ICML '04, p.58, 2004.
DOI : 10.1145/1015330.1015383

F. Suard, V. Guigue, A. Rakotomamonjy, and A. Bensrhair, Pedestrian detection using stereo-vision and graph kernels, in Intelligent Vehicles Symposium, p.267272, 2005.

F. Dupé and L. Brun, Classication de formes avec un noyau sur graphes exibles et robuste au bruit, RFIA, 2010.

K. M. Borgwardt, C. S. Ong, S. Schönauer, S. V. Vishwanathan, A. J. Smola et al., Protein function prediction via graph kernels, ISMB, p.4756, 2005.
DOI : 10.1093/bioinformatics/bti1007
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.528.6168

N. Shervashidze, S. V. Vishwanathan, T. Petri, K. Mehlhorn, and K. M. Borgwardt, Ecient graphlet kernels for large graph comparison, AISTATS, 2009.

P. Mahé and J. Vert, Graph kernels based on tree patterns for molecules, Machine Learning, p.335, 2009.
DOI : 10.1007/s10994-008-5086-2

N. Shervashidze and K. M. Borgwardt, Fast subtree kernel on graphs, NIPS, 2009.

R. C. Wilson and E. R. Hancock, Pattern spaces from graph polynomials, 12th International Conference on Image Analysis and Processing, 2003.Proceedings., p.480485, 2003.
DOI : 10.1109/ICIAP.2003.1234096

Y. Chen and J. Wang, Image categorization by learning and reasoning with regions, International Journal on Machine Learning Research, vol.5, p.913939, 2004.

F. Moosmann, E. Nowak, and F. Jurie, Randomized clustering forests for image classication, IEEE Trans. on Pattern Analysis and Machine Intelligence, vol.30, 2008.

H. Bunke and K. Riesen, A Family of Novel Graph Kernels for Structural Pattern Recognition, CIARP, p.2031, 2007.
DOI : 10.1007/978-3-540-76725-1_3

A. M. Smalter, J. Huan, and G. H. Lushington, GPM: A graph pattern matching kernel with diffusion for chemical compound classification, 2008 8th IEEE International Conference on BioInformatics and BioEngineering, p.16, 2008.
DOI : 10.1109/BIBE.2008.4696654

I. Gondra and D. Heisterkamp, Learning in Region-Based Image Retrieval with Generalized Support Vector Machines, 2004 Conference on Computer Vision and Pattern Recognition Workshop, pp.149-149, 2004.
DOI : 10.1109/CVPR.2004.384

J. Mairal, F. Bach, J. Ponce, and G. Sapiro, Online dictionary learning for sparse coding, Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, 2009.
DOI : 10.1145/1553374.1553463

J. Eichhorn and O. Chapelle, Object categorization with svm : kernels for local features, Tech. Rep, 2004.

P. Gosselin, M. Cord, and S. Philipp-foliguet, Kernels on Bags of Fuzzy Regions for Fast Object retrieval, 2007 IEEE International Conference on Image Processing, 2007.
DOI : 10.1109/ICIP.2007.4378920

T. K. Tsuda and K. Asai, Marginalized kernels for biological sequences, Bioinformatics, vol.18, issue.Suppl 1, 2002.
DOI : 10.1093/bioinformatics/18.suppl_1.S268

V. D. Of, S. V. Vishwanathan, and A. J. Smola, Fast kernels for string and tree matching, Advances in Neural Information Processing Systems 15, p.569576, 2003.

S. Philipp-foliguet and J. Gony, FReBIR : Fuzzy regions-based image retrieval, Information Processing and Management of Uncertainty (IPMU), 2006.

N. Govert and G. Kazai, Overview of the initiative for the evaluation of xml retrieval, Fuhr et al, p.117, 2003.

H. P. Moravec, Towards Automatic Visual Obstacle Avoidance, Proc. 5th International Joint Conference on Articial Intelligence, 1977.

J. Matas, O. Chum, M. Urban, and T. Pajdla, Robust wide-baseline stereo from maximally stable extremal regions, british Machine Vision Computing, pp.761767-761773, 2002.

P. Arbelaez, M. Maire, C. Fowlkes, and J. Malik, From contours to regions : An empirical evaluation, Computer Vision and Pattern Recognition, IEEE Computer Society Conference on, vol.0, p.22942301, 2009.

J. C. Bezdek, J. Keller, and S. K. Krisnapuram, Pal, Fuzzy models and algorithms for pattern recognition and image processing, 2000.

S. Philipp-foliguet, J. Gony, and P. Gosselin, Frebir : an image retrieval system based on fuzzy region matching Available : http://publi-etis.ensea.fr Region-based 3d artwork indexing and classication, Proceedings of the IEEE 3DTV-Con Conference, pp.693707-693715, 2008.

P. Matsakis, J. M. Keller, O. Sjahputera, and J. Marjamaa, The use of force histograms for ane-invariant relative position description, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, p.118, 2004.

C. Hudelot, J. Atif, and I. Bloch, Fuzzy spatial relation ontology for image interpretation, Fuzzy Sets and Systems, from Knowledge Representation to Information Processing and Management - Selected papers from the French Fuzzy Days, pp.6-11, 2006.

J. Matas, O. Chum, M. Urban, and T. Pajdla, Rosbut wide baseline stereo from maximally stable external regions, Proceedings of the Bristish Machine Vision Conference, p.384393, 2002.

J. Haugeard, S. Philipp-foliguet, and P. Gosselin, Kernel on Graphs Based on Dictionary of Paths for Image Retrieval, 2010 20th International Conference on Pattern Recognition, 2010.
DOI : 10.1109/ICPR.2010.726
URL : https://hal.archives-ouvertes.fr/hal-00520295

J. Haugeard and S. Philipp-foliguet, Recherche d'objets par appariement de graphes combinant contours et regions, RFIA : Reconnaissance des Formes et Intelligence Articielle, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00515880

J. Haugeard, S. Philipp-foliguet, and F. Precioso, Windows and facades retrieval using similarity on graph of contours, 2009 16th IEEE International Conference on Image Processing (ICIP), 2009.
DOI : 10.1109/ICIP.2009.5413408
URL : https://hal.archives-ouvertes.fr/hal-00536261

J. Haugeard, S. Philipp-foliguet, F. Precioso, and J. Lebrun, Extraction of windows in facade using kernel on graph of contours, in Image Analysis