1. Arvind, V., Kurur, P.P.: Graph isomorphism is in SPP. In: The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 Proceedings, pp. 743–750. IEEE (2002)
2. Babai, L.: Graph isomorphism in quasipolynomial time. In: Proceedings of the Forty-Eight Annual ACM Symposium on Theory of Computing, pp. 684–697. ACM (2016)
3. Babai, L., Luks, E.M.: Canonical labeling of graphs. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pp. 171–183. ACM (1983)
4. Bloyet, N., Marteau, P.-F., Frénod, E.: Étude lexicographique de sous-graphes pour l’élaboration de modèles structures à activité–cas de la chimie organique. In: Extraction et Gestion des Connaissances: Actes de la conférence EGC 2019, vol. 79, p. 3. BoD-Books on Demand (2019)
5. Booth, K.S., Colbourn, C.J: Problems polynomially equivalent to graph isomorphism. Computer Science Department, University (1979)