He, J., Chen, J., Huang, G., Cao, J., Zhang, Z., Zheng, H., . . . Van Zundert, A. (2021). A polynomial‐time algorithm for simple undirected graph isomorphism. Concurrency and computation, 33(7), 1. https://doi.org/10.1002/cpe.5484
Citácia podle Chicago (17th ed.)He, Jing, et al. "A Polynomial‐time Algorithm for Simple Undirected Graph Isomorphism." Concurrency and Computation 33, no. 7 (2021): 1. https://doi.org/10.1002/cpe.5484.
Citácia podľa MLA (8th ed.)He, Jing, et al. "A Polynomial‐time Algorithm for Simple Undirected Graph Isomorphism." Concurrency and Computation, vol. 33, no. 7, 2021, p. 1, https://doi.org/10.1002/cpe.5484.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..