R. Myers, R. C. Wilson, and E. R. Hancock, Bayesian graph edit distance, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.22, issue.6, pp.628-635, 2000.
DOI : 10.1109/34.862201
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.4132

A. Robles-kelly and E. R. Hancock, Graph edit distance from spectral seriation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.27, issue.3, pp.365-378, 2005.
DOI : 10.1109/TPAMI.2005.56

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

H. Bunke and K. Shearer, A graph distance metric based on the maximal common subgraph, Pattern Recognition Letters, vol.19, issue.3-4, pp.255-259, 1998.
DOI : 10.1016/S0167-8655(97)00179-7

H. Bunke, A. Munger, and X. Jiang, Combinatorial Search vsGenetic Algorithms: A Case Study Based on the Generalized Median Graph Problem, Pattern Recognition Letters, vol.20, pp.11-13, 1999.

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

S. Gold and A. Rangarajan, A graduated assignment algorithm for graph matching, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.18, issue.4, pp.377-388, 1996.
DOI : 10.1109/34.491619

A. Shokoufandeh and S. Dickinson, Applications of Bipartite Matching to Problems in Object Recognition, Proceedings, ICCV Workshop on Graph Algorithms and Computer Vision, 1999.

A. Shokoufandeh and S. Dickinson, A Unified Framework for Indexing and Matching Hierarchical Shape Structures, Lecture Notes in Computer Science, vol.2059, p.6784, 2001.
DOI : 10.1007/3-540-45129-3_6

M. A. Eshera and K. S. Fu, A graph distance measure for image analysis, IEEE Transactions on Systems, Man, and Cybernetics, vol.14, issue.3, pp.398-408, 1984.
DOI : 10.1109/TSMC.1984.6313232

S. Sorlin, C. Solnon, and J. M. Jolion, A Generic Multivalent Graph Distance Measure Based on Multivalent Matchings Applied Graph Theory in Computer Vision and Pattern Recognition, pp.151-181, 2007.

D. Lopresti and G. Wilfong, A fast technique for comparing graph representations with applications to performance evaluation, International Journal on Document Analysis and Recognition, vol.6, issue.4, pp.219-229, 2004.
DOI : 10.1007/s10032-003-0106-z

A. Sanfeliu and K. S. Fu, A distance measure between attributed relational graphs for pattern recognition, IEEE Transactions on Systems, Man, and Cybernetics, vol.13, issue.3, pp.353-362, 1983.
DOI : 10.1109/TSMC.1983.6313167

N. P. Apostolos and M. Yannis, Structure-Based Similarity Search with Graph Histograms, Proc. of the 10th International Workshop on Database & Expert Systems Applications, 1999.

M. Gori, M. Maggini, and L. Sarti, Exact and approximate graph matching using random walks, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.27, issue.7, pp.1100-1111, 2005.
DOI : 10.1109/TPAMI.2005.138

R. K. Chung and F. , Spectral Graph Theory, 1997.
DOI : 10.1090/cbms/092

L. Xu and I. King, A PCA approach for fast retrieval of structural patterns in attributed graphs, IEEE Trans. Systems, Man, and Cybernetics, vol.31, issue.5, pp.812-817, 2001.

B. Luo and E. R. Hancock, Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition, IEEE Trans. on Pattern Analysis and Machine Intelligence, vol.23, issue.10, pp.1120-1136, 2001.

H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.83-97, 1955.
DOI : 10.1002/nav.3800020109

S. A. Nene, S. K. Nayar, and H. Murase, Columbia Object Image Library (COIL- 100), technical report, 1996.

K. Riesen and H. Bunke, IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning, pp.287-297, 2008.
DOI : 10.1007/978-3-540-89689-0_33

P. Dosch and E. Valveny, Report on the Second Symbol Recognition Contest, Proc. 6th IAPR Workshop on Graphics Recognition, pp.381-397, 2005.
DOI : 10.1007/11767978_35
URL : https://hal.archives-ouvertes.fr/inria-00091343

S. Fortune, Voronoi diagrams and Delaunay triangulations Computing in Euclidean Geometry, pp.193-233, 1992.

C. T. Zahn, Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters, IEEE Transactions on Computers, vol.20, issue.1, pp.68-86, 1971.
DOI : 10.1109/T-C.1971.223083

T. Hofmann and J. M. Buhmann, Multidimensional Scaling and Data Clustering, Advances in Neural Information Processing Systems (NIPS 7), pp.459-466, 1995.

W. M. Rand, Objective Criteria for the Evaluation of Clustering Methods, Journal of the American Statistical Association, vol.15, issue.336, pp.846-850, 1971.
DOI : 10.1080/01621459.1963.10500845

J. Dunn, Well-Separated Clusters and Optimal Fuzzy Partitions, Journal of Cybernetics, vol.4, issue.1, pp.95-104, 1974.
DOI : 10.1080/01969727408546059