Massively parallel algorithms for fully dynamic all-pairs shortest paths
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 3 − α 6 log n / α ) . We compare our algorithm with the existing static APSP algorithms in the MPC model, demonstrating the efficiency of...
Uložené v:
| Vydané v: | Frontiers of Computer Science Ročník 18; číslo 4; s. 184611 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Beijing
Higher Education Press
01.08.2024
Springer Nature B.V |
| Predmet: | |
| ISSN: | 2095-2228, 2095-2236 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | 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
3
−
α
6
log
n
/
α
)
. We compare our algorithm with the existing static APSP algorithms in the MPC model, demonstrating the efficiency of our approach |
|---|---|
| Bibliografia: | Document received on :2023-06-01 Document accepted on :2024-01-10 SourceType-Scholarly Journals-1 ObjectType-Correspondence-1 content type line 14 |
| ISSN: | 2095-2228 2095-2236 |
| DOI: | 10.1007/s11704-024-3452-2 |