Ding, Jian, Ma, Zongming, Wu, Yihong, and Xu, Jiaming. Efficient random graph matching via degree profiles. Retrieved from https://par.nsf.gov/biblio/10216944. Probability Theory and Related Fields 179.1-2 Web. doi:10.1007/s00440-020-00997-4.
Ding, Jian, Ma, Zongming, Wu, Yihong, & Xu, Jiaming. Efficient random graph matching via degree profiles. Probability Theory and Related Fields, 179 (1-2). Retrieved from https://par.nsf.gov/biblio/10216944. https://doi.org/10.1007/s00440-020-00997-4
@article{osti_10216944,
place = {Country unknown/Code not available},
title = {Efficient random graph matching via degree profiles},
url = {https://par.nsf.gov/biblio/10216944},
DOI = {10.1007/s00440-020-00997-4},
abstractNote = {},
journal = {Probability Theory and Related Fields},
volume = {179},
number = {1-2},
author = {Ding, Jian and Ma, Zongming and Wu, Yihong and Xu, Jiaming},
editor = {null}
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.