Skip to main content
Springer Nature Link
Log in

Massively parallel algorithms for fully dynamic all-pairs shortest paths

  • Letter
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Conclusion

In this paper, we propose the first fully dynamic parallel allpairs shortest path algorithm in the MPC model with a worstcase update rounds of \(O({n^{{2 \over 3} - {\alpha \over 6}}}\log n/\alpha )\). We compare our algorithm with the existing static APSP algorithms in the MPC model, demonstrating the efficiency of our approach

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  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

    Google Scholar 

  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

    Article  MathSciNet  Google Scholar 

  4. Henzinger M R, King V. Maintaining minimum spanning forests in dynamic graphs. SIAM Journal on Computing, 2001, 31(2): 364–374

    Article  MathSciNet  Google Scholar 

  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

  6. Sao P, Kannan R, Gera P, Vuduc R W. A supernodal all-pairs shortest path algorithm. In: Proceedings of the 25th SIGPLAN Symposium on Principles and Practice of Parallel Programming. 2020, 250–261

  7. Hajiaghayi M, Lattanzi S, Seddighin S, Stein C. MapReduce meets finegrained complexity: MapReduce algorithms for APSP, matrix multiplication, 3-SUM, and beyond. 2019, arXiv preprint arXiv: 1905.01748

  8. Karczmarz A, Sankowski P. A deterministic parallel APSP algorithm and its applications. In: Proceedings of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. 2021, 255–272

  9. Cao N, Fineman J T. Parallel exact shortest paths in almost linear work and square root depth. In: Proceedings of 2023 ACM-SIAM Symposium on Discrete Algorithms. 2023, 4354–4372

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China (Grant Nos. 61972447 and 61832006).

Author information

Authors and Affiliations

  1. National Engineering Research Center for Big Data Technology and System, Services Computing Technology and System Lab, Cluster and Grid Computing Lab, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, 430074, China

    Chilei Wang, Qiang-Sheng Hua & Hai Jin

  2. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, 210023, China

    Chaodong Zheng

Authors
  1. Chilei Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Qiang-Sheng Hua
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Hai Jin
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Chaodong Zheng
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Qiang-Sheng Hua.

Ethics declarations

Competing interests The authors declare that they have no competing interests or financial conflicts to disclose.

Additional information

Supporting information The supporting information is available online at journal.hep.com.cn and link.springer.com.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, C., Hua, QS., Jin, H. et al. Massively parallel algorithms for fully dynamic all-pairs shortest paths. Front. Comput. Sci. 18, 184611 (2024). https://doi.org/10.1007/s11704-024-3452-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11704-024-3452-2