1. Arkin, E.M., Paul Chew, L., Huttenlocher, D.P., Kedem, K., Mitchell, J.S.B.: An efficiently computable metric for comparing polygonal shapes. IEEE Trans. Pattern Anal. Mach. Intell. 13(3), 209–216 (1991)
2. Delalandre, M., Pridmore, T., Valveny, E., Locteau, H., Trupin, E.: Building synthetic graphical documents for performance evaluation, pp. 288–298. Springer, Heidelberg (2008)
3. Dutta, A.: Symbol spotting in graphical documents by serialized subgraph matching, Master’s thesis, Computer Vision Centre, Universitat Autònoma de Barcelona, Edifici O, Campus UAB, 08193 Bellatera, Barcelona, Spain (September 2010)
4. Lladós, J., Martí, E., Villanueva, J.J.: Symbol recognition by error-tolerant subgraph matching between region adjacency graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 23, 1137–1143 (2001)
5. Messmer, B.T., Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 20, 493–504 (1998)