A. Fischer, C. Y. Suen, and V. F. , A Fast Matching Algorithm for Graph-Based Handwriting Recognition, pp.194-203, 2013.
DOI : 10.1007/978-3-642-38221-5_21

D. J. Andrew and E. R. Cross, Graph matching with a dual-step em algorithm, IEEE Trans. Pattern Anal. Mach. Intell, vol.20, issue.11, pp.1236-1253, 1998.

W. Christmas, J. Kittler, and M. Petrou, Structural matching in computer vision using probabilistic relaxation. Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol.17, issue.8, pp.749-764, 1995.
DOI : 10.1109/34.400565
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.590.5090

A. D. Cross, R. C. Wilson, and E. R. Hancock, Inexact graph matching using genetic search, Pattern Recognition, vol.30, issue.6, pp.953-970, 1997.
DOI : 10.1016/S0031-3203(96)00123-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.459.4948

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

S. Fankhauser, K. Riesen, H. Bunke, and P. J. Dickinson, SUBOPTIMAL GRAPH ISOMORPHISM USING BIPARTITE MATCHING, International Journal of Pattern Recognition and Artificial Intelligence, vol.26, issue.06, p.26, 2012.
DOI : 10.1142/S0218001412500139

A. Finch, R. Wilson, and E. Hancock, An Energy Function and Continuous Edit Process for Graph Matching, Neural Computation, vol.6, issue.7, pp.1873-1894, 1998.
DOI : 10.1162/neco.1994.6.3.341

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

P. Kuner and B. Ueberreiter, PATTERN RECOGNITION BY GRAPH MATCHING???COMBINATORIAL VERSUS CONTINUOUS OPTIMIZATION, International Journal of Pattern Recognition and Artificial Intelligence, vol.02, issue.03, pp.527-542, 1988.
DOI : 10.1142/S0218001488000303

M. Neuhaus, K. R. Bunke, and H. , Fast Suboptimal Algorithms for the Computation of Graph Edit Distance, Proceedings of 11th International Workshop on Structural and Syntactic Pattern Recognition, pp.163-172, 2006.
DOI : 10.1007/11815921_17

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

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

K. Riesen and H. Bunke, Graph Classification and Clustering Based on Vector Space Embedding, 2010.
DOI : 10.1142/7731

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

A. Sanfeliu and K. 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

W. Tsai and K. Fu, Error-correcting isomorphisms of attributed relational graphs for pattern analysis . Systems, Man and Cybernetics, IEEE Transactions on, vol.9, issue.12, pp.757-768, 1979.

W. Tsai and K. Fu, Subgraph error-correcting isomorphisms for syntactic pattern recognition. Systems , Man and Cybernetics, IEEE Transactions, issue.1, pp.1348-62, 1983.

M. Vento, A long trip in the charming world of graphs for Pattern Recognition, Pattern Recognition, vol.48, issue.2, pp.291-301, 2015.
DOI : 10.1016/j.patcog.2014.01.002

Z. Zeng, A. K. Tung, J. Wang, J. Feng, and L. Zhou, Comparing stars, Proc. VLDB Endow, pp.25-36, 2009.
DOI : 10.14778/1687627.1687631