Eric Yanchenko. Graph sub-sampling for divide-and-conquer algorithms in large networks. // Statistics and Computing. – 2025. – DOI: 10.1007/s11222-025-10620-y. – URL: https://doi.org/10.1007/s11222-025-10620-y
Eric Yanchenko (2025). Graph sub-sampling for divide-and-conquer algorithms in large networks. Statistics and Computing. https://doi.org/10.1007/s11222-025-10620-y
Eric Yanchenko. “Graph sub-sampling for divide-and-conquer algorithms in large networks.” Statistics and Computing, 2025. doi:10.1007/s11222-025-10620-y.
@article{Yanchenko2025,
title = {Graph sub-sampling for divide-and-conquer algorithms in large networks},
author = {Yanchenko, Eric},
journal = {Statistics and Computing},
year = {2025},
doi = {10.1007/s11222-025-10620-y},
url = {https://doi.org/10.1007/s11222-025-10620-y}
}