APA (7th ed.) Citation

Ding, J., Ma, Z., Wu, Y., & Xu, J. (2021). Efficient random graph matching via degree profiles. Probability theory and related fields, 179(1-2), 29-115. https://doi.org/10.1007/s00440-020-00997-4

Chicago Style (17th ed.) Citation

Ding, Jian, Zongming Ma, Yihong Wu, and Jiaming Xu. "Efficient Random Graph Matching via Degree Profiles." Probability Theory and Related Fields 179, no. 1-2 (2021): 29-115. https://doi.org/10.1007/s00440-020-00997-4.

MLA (9th ed.) Citation

Ding, Jian, et al. "Efficient Random Graph Matching via Degree Profiles." Probability Theory and Related Fields, vol. 179, no. 1-2, 2021, pp. 29-115, https://doi.org/10.1007/s00440-020-00997-4.