1. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: W. H. Freeman and Co, 1979.
2. Ullmann, J.R., An algorithm for subgraph isomorphism, J. ACM, 1976, vol. 23, no. 1, pp. 31–42. https://doi.org/10.1145/321921.321925
3. Cordella, L.P., Foggia, P., Sansone, C., and Vento, M., Performance evaluation of the VF graph matching algorithm, Proc. 10th Int. Conf. on Image Analysis and Processing, Venice, 1999, IEEE, 1999, pp. 1172–1177. https://doi.org/10.1109/iciap.1999.797762
4. Cordella, L.P., Foggia, P., Sansone, C., and Vento, M., An improved algorithm for matching large graphs, Proc. 3rd IAPR-TC-15 Int. Workshop on Graph-Based Representations, 2001, pp. 149–152.
5. Carle, V., Foggia, P., Saggese, A., and Vento, M., Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3, IEEE Trans. Pattern Anal. Mach. Intell., 2018, vol. 40, no. 4, pp. 804–818. https://doi.org/10.1109/TPAMI.2017.2696940