Crossref
Improved all-pairs approximate shortest paths in congested clique
Distributed Computing · 2026-06 · 39 (2)
DOI: 10.1007/s00446-025-00501-y ↗Kurz gefasst
Fachartikel in der Zeitschrift Distributed Computing, online erschienen am 04.04.2026. Verfasst von Hong Duc Bui und 4 weiteren Autor:innen. Die Arbeit nennt 22 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Bui, H. D., Chandra, S., Chang, Y., Dory, M., & Leitersdorf, D. (2026). Improved all-pairs approximate shortest paths in congested clique. Distributed Computing, 39(2). https://doi.org/10.1007/s00446-025-00501-y
Vancouver
Bui HD, Chandra S, Chang Y, Dory M, Leitersdorf D. Improved all-pairs approximate shortest paths in congested clique. Distributed Computing. 2026;39(2). doi:10.1007/s00446-025-00501-y
BibTeX
@article{Bui2026,
author = {Bui, Hong Duc and Chandra, Shashwat and Chang, Yi-Jun and Dory, Michal and Leitersdorf, Dean},
title = {Improved all-pairs approximate shortest paths in congested clique},
journal = {Distributed Computing},
year = {2026},
volume = {39},
number = {2},
doi = {10.1007/s00446-025-00501-y}
}
EUVIMED