Massively parallel algorithms for fully dynamic all-pairs shortest paths
Authors:
- 8 April 2024
- journal article
- letter
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 18 (4) , 1-3
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Parallel Exact Shortest Paths in Almost Linear Work and Square Root Depth2023
- Incremental algorithms for the maximum internal spanning tree problemScience China Information Sciences, 2021
- A Deterministic Parallel APSP Algorithm and its Applications2021
- A supernodal all-pairs shortest path algorithm2020
- Dynamic Algorithms for the Massively Parallel Computation Model2019
- Fully dynamic all-pairs shortest paths with worst-case update-time revisited2017
- Maintaining Minimum Spanning Forests in Dynamic GraphsSIAM Journal on Computing, 2001