Cite
Efficient random graph matching via degree profiles.
MLA
Ding, Jian, et al. “Efficient Random Graph Matching via Degree Profiles.” Probability Theory & Related Fields, vol. 179, no. 1/2, Feb. 2021, pp. 29–115. EBSCOhost, https://doi.org/10.1007/s00440-020-00997-4.
APA
Ding, J., Ma, Z., Wu, Y., & Xu, J. (2021). Efficient random graph matching via degree profiles. Probability Theory & Related Fields, 179(1/2), 29–115. https://doi.org/10.1007/s00440-020-00997-4
Chicago
Ding, Jian, Zongming Ma, Yihong Wu, and Jiaming Xu. 2021. “Efficient Random Graph Matching via Degree Profiles.” Probability Theory & Related Fields 179 (1/2): 29–115. doi:10.1007/s00440-020-00997-4.