Cite
APA Citation
He, J., Huang, G., Cao, J., Zhang, Z., Zheng, H., Zhang, P., Zarei, R., Susanto, F., Wang, R., Ji, Y., Fan, W., Xie, Z., Wang, X., Guo, M., Chi, C., Zhang, J., Li, Y., Chen, X., Shi, Y., & Van Zundert, A. (2022). a polynomial‐time algorithm for simple undirected graph isomorphism. Concurrency and computation, 34, n/a. http://access.bl.uk/ark:/81055/vdc_100148624653.0x000020