Keren Censor Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf. Fast approximate shortest paths in the congested clique. Distributed Computing, 34(6):463-487, 2021. [doi]
@article{Censor-HillelDK21,
title = {Fast approximate shortest paths in the congested clique},
author = {Keren Censor Hillel and Michal Dory and Janne H. Korhonen and Dean Leitersdorf},
year = {2021},
doi = {10.1007/s00446-020-00380-5},
url = {https://doi.org/10.1007/s00446-020-00380-5},
researchr = {https://researchr.org/publication/Censor-HillelDK21},
cites = {0},
citedby = {0},
journal = {Distributed Computing},
volume = {34},
number = {6},
pages = {463-487},
}