1. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence 18(3), 265–298 (2004)
2. Cordella, L., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(10), 1367–1372 (2004)
3. Csardi, G., Nepusz, T.: The igraph software package for complex network research. Inter. Journal Complex Systems 1695, 1–9 (2006),
http://igraph.sourceforge.net
4. Dahm, N., Bunke, H., Caelli, T., Gao, Y.: Topological features and iterative node elimination for speeding up subgraph isomorphism detection. In: Proceedings of the 21st International Conference on Pattern Recognition (2012)
5. Fankhauser, S., Riesen, K., Bunke, H., Dickinson, P.: Suboptimal graph isomorphism using bipartite matching. International Journal of Pattern Recognition and Artificial Intelligence (accepted for publication)