Lin Zhu, Qiang-sheng Hua, Hai Jin. A parallel all-pairs shortest paths algorithm for dynamic graphs. // CCF Transactions on High Performance Computing. – 2025. – DOI: 10.1007/s42514-025-00234-1. – URL: https://doi.org/10.1007/s42514-025-00234-1
Lin Zhu, Qiang-sheng Hua, & Hai Jin (2025). A parallel all-pairs shortest paths algorithm for dynamic graphs. CCF Transactions on High Performance Computing. https://doi.org/10.1007/s42514-025-00234-1
Lin Zhu, et al. “A parallel all-pairs shortest paths algorithm for dynamic graphs.” CCF Transactions on High Performance Computing, 2025. doi:10.1007/s42514-025-00234-1.
@article{Zhu2025,
title = {A parallel all-pairs shortest paths algorithm for dynamic graphs},
author = {Zhu, Lin and Hua, Qiang-sheng and Jin, Hai},
journal = {CCF Transactions on High Performance Computing},
year = {2025},
doi = {10.1007/s42514-025-00234-1},
url = {https://doi.org/10.1007/s42514-025-00234-1}
}