APA (7th ed.) Citation

Ding, J., Du, H., & Gong, S. (2024). A polynomial‐time approximation scheme for the maximal overlap of two independent Erdős–Rényi graphs. Random structures & algorithms, 65(1), 220-257. https://doi.org/10.1002/rsa.21212

Chicago Style (17th ed.) Citation

Ding, Jian, Hang Du, and Shuyang Gong. "A Polynomial‐time Approximation Scheme for the Maximal Overlap of Two Independent Erdős–Rényi graphs." Random Structures & Algorithms 65, no. 1 (2024): 220-257. https://doi.org/10.1002/rsa.21212.

MLA (9th ed.) Citation

Ding, Jian, et al. "A Polynomial‐time Approximation Scheme for the Maximal Overlap of Two Independent Erdős–Rényi graphs." Random Structures & Algorithms, vol. 65, no. 1, 2024, pp. 220-257, https://doi.org/10.1002/rsa.21212.