Improved All-Pairs Approximate Shortest Paths in Congested Clique

4 May 2024

Papers citing "Improved All-Pairs Approximate Shortest Paths in Congested Clique"

2 / 2 papers shown

Title
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs K. Censor-Hillel Orr Fischer T. Gonen F. Gall Dean Leitersdorf R. Oshman 115 26 0 19 Jan 2021
Exponentially Faster Shortest Paths in the Congested Clique Michal Dory M. Parter 108 23 0 06 Mar 2020