Z. Abu-aisheh, R. Raveaux, and J. Y. Ramel, Anytime graph matching, Pattern Recognition Letters, vol.84, issue.215, p.224, 2016.
DOI : 10.1016/j.patrec.2016.10.004

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

Z. Abu-aisheh, R. Raveaux, and J. Y. Ramel, Fast nearest neighbor search in graph space via a branch-and-bound strategy, p.0, 2017.
DOI : 10.1007/978-3-319-58961-9_18

Z. Abu-aisheh, R. Raveaux, J. Y. Ramel, and P. Martineau, An Exact Graph Edit Distance Algorithm for Solving Pattern Recognition Problems, Proceedings of the International Conference on Pattern Recognition Applications and Methods, p.271278, 2015.
DOI : 10.5220/0005209202710278

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

G. E. Batista and D. F. Silva, How k-nearest neighbor parameters aect its performance, Argentine Symposium on Articial Intelligence, p.95106, 2009.

N. Bhatia and . Vandana, Survey of nearest neighbor techniques, 2010.

S. Bougleux, L. Brun, V. Carletti, P. Foggia, B. Gaüzère et al., Graph edit distance as a quadratic assignment problem, Pattern Recognition Letters, vol.87, issue.38, p.46, 2017.
DOI : 10.1016/j.patrec.2016.10.001

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

V. Carletti, B. Gaüzère, L. Brun, and M. Vento, Approximate Graph Edit Distance Computation Combining Bipartite Matching and Exact Neighborhood Substructure Distance, pp.188-197, 2015.
DOI : 10.1007/978-3-319-18224-7_19

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

T. Cover and P. Hart, Nearest neighbor pattern classication, IEEE Trans. Inf. Theor, vol.13, p.2127, 2006.

S. Dreiseitl and L. Ohno-machado, Logistic regression and articial neural network classication models: a methodology review, Journal of Biomedical Informatics, vol.35, issue.352, p.359, 2002.
DOI : 10.1016/s1532-0464(03)00034-0

URL : https://doi.org/10.1016/s1532-0464(03)00034-0

M. Ferrer, F. Serratosa, and K. Riesen, A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching, p.7786, 2015.
DOI : 10.1007/978-3-319-18224-7_8

A. Fischer, C. Y. Suen, V. Frinken, K. Riesen, and H. Bunke, Approximation of graph edit distance based on hausdor matching, Pattern Recognition, vol.48, p.331343, 2015.
DOI : 10.1016/j.patcog.2014.07.015

B. Gaüzère, L. Brun, and D. Villemin, Two new graphs kernels in chemoinformatics, Pattern Recognition Letters, vol.33, 2012.

N. Kooli and A. Belaïd, Inexact graph matching for entity recognition in OCRed documents, 2016 23rd International Conference on Pattern Recognition (ICPR), p.40714076, 2016.
DOI : 10.1109/ICPR.2016.7900271

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

C. F. Moreno-garcía, X. Cortés, and F. Serratosa, A Graph Repository for Learning Error-Tolerant Graph Matching, p.519529, 2016.
DOI : 10.1109/34.531800

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

M. Neuhaus, Fast Suboptimal Algorithms for the Computation of Graph Edit Distance, Proceedings of 11th International Workshop on Structural and Syntactic Pattern Recognition, p.163172, 2006.
DOI : 10.1007/11815921_17

R. Raveaux, S. Adam, P. Héroux, and É. Trupin, Learning graph prototypes for shape recognition, Computer Vision and Image Understanding, vol.115, issue.7, p.905918, 2011.
DOI : 10.1016/j.cviu.2010.12.015

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

K. Riesen and B. H. , IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning, p.287297, 2008.
DOI : 10.1093/nar/28.1.235

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

K. Riesen, Structural Pattern Recognition with Graph Edit Distance -Approximation Algorithms and Applications. Advances in Computer Vision and Pattern Recognition, 2015.
DOI : 10.1007/978-3-319-27252-8

K. Riesen, Structural Pattern Recognition with Graph Edit Distance -Approximation Algorithms and Applications Advances in Computer Vision and Pattern Recognition URL: https, pp.978-981, 2015.
DOI : 10.1007/978-3-319-27252-8

K. Riesen and H. Bunke, Graph classication based on vector space embedding. IJPRAI 23, 2009.

K. Riesen, S. Fankhauser, and H. Bunke, Speeding up graph edit distance computation with a bipartite heuristic, 2007.

K. Riesen, A. Fischer, and H. Bunke, Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation, 2014.
DOI : 10.1007/978-3-319-11656-3_11

K. Riesen, Graph Classication and Clustering Based on Vector Space Embedding, 2010.
DOI : 10.1142/9789814304726

F. Serratosa, Fast computation of Bipartite graph matching, Pattern Recognition Letters, vol.45, 2014.
DOI : 10.1016/j.patrec.2014.04.015

F. Serratosa, Speeding up Fast Bipartite Graph Matching Through a New Cost Matrix, International Journal of Pattern Recognition and Artificial Intelligence, vol.29, issue.02, 2015.
DOI : 10.1016/S0167-8655(97)00117-7

X. Wang, A fast exact k-nearest neighbors algorithm for high dimensional search using k-means clustering and triangle inequality, The 2011 International Joint Conference on Neural Networks, 2012.
DOI : 10.1109/IJCNN.2011.6033373

URL : http://europepmc.org/articles/pmc3255306?pdf=render

Z. Zeng, A. K. Tung, J. Wang, J. Feng, and L. Zhou, Comparing stars, Proc. VLDB Endow. 2, p.2536, 2009.
DOI : 10.14778/1687627.1687631