Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Bui, Hong Duc"'
In this paper, we present new algorithms for approximating All-Pairs Shortest Paths (APSP) in the Congested Clique model. We present randomized algorithms for weighted undirected graphs. Our first contribution is an $O(1)$-approximate APSP algorithm
Externí odkaz:
http://arxiv.org/abs/2405.02695