Massively parallel algorithms for fully dynamic all-pairs shortest paths

{{article.zuoZheEn}}

PDF(314 KB)
PDF(314 KB)
Front. Comput. Sci. ›› 2024, Vol. 18 ›› Issue (4) : 184611. DOI: 10.1007/s11704-024-3452-2
LETTER

Massively parallel algorithms for fully dynamic all-pairs shortest paths

  • {{article.zuoZheEn}}
Author information +
History +

Highlights

{{article.highlightEn}}

Abstract

{{article.abstractEn}}

Author summary

{{article.authorSummayEn}}

Keywords

Cite this article

EndNote

Ris (Procite)

Bibtex

Download citation ▾
{{article.zuoZheEn_L}}. {{article.titleEn}}. Front. Comput. Sci., 2024, 18(4): 184611 https://doi.org/10.1007/s11704-024-3452-2

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

RIGHTS & PERMISSIONS

{{article.copyright.year}} {{article.copyright.holder}}
PDF(314 KB)

Accesses

Citations

Detail
Sections
Recommended

/

〈 〉