Author:
Wang Chilei,Hua Qiang-Sheng,Jin Hai,Zheng Chaodong
Publisher
Springer Science and Business Media LLC
Reference9 articles.
1. Dinitz M, Nazari Y. Massively parallel approximate distance sketches. In: Proceedings of the 23rd International Conference on Principles of Distributed Systems. 2019, 35: 1–35: 17
2. Abraham I, Chechik S, Krinninger S. Fully dynamic all-pairs shortest paths with worst-case update-time revisited. In: Proceedings of the 28th Annual ACM SIAM Symposium on Discrete Algorithms. 2017, 440–452
3. Zhu X, Li W, Yang Y, Wang J. Incremental algorithms for the maximum internal spanning tree problem. Science China Information Sciences, 2021, 64(5): 152103
4. Henzinger M R, King V. Maintaining minimum spanning forests in dynamic graphs. SIAM Journal on Computing, 2001, 31(2): 364–374
5. Italiano G F, Lattanzi S, Mirrokni V S, Parotsidis N. Dynamic algorithms for the massively parallel computation model. In: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures. 2019, 49–58