Graph reconstruction in the congested clique
Montealegre
R
author
Perez-Salazar
S
author
Rapaport
I
author
Todinca
I
author
2020
English
In this paper we study the reconstruction problem in the congested clique model. Given a class of graphs g, the problem is defined as follows: if G is not an element of g, then every node must reject; if G is an element of g, then every node must end up knowing all the edges of G. The cost of an algorithm is the total number of bits received by any node through one link. It is not difficult to see that the cost of any algorithm that solves this problem is Omega(log vertical bar g(n)vertical bar/n), where g(n) is the subclass of all n-node labeled graphs in g. We prove that the lower bound is tight and that it is possible to achieve it with only 2 rounds. (C) 2020 Elsevier Inc. All rights reserved.
Distributed computing
Congested clique
Round complexity
Reconstruction problem
Graph classes
WOS:000539435200001
exported from refbase (show.php?record=1190), last updated on Sat, 01 Aug 2020 15:07:31 -0400
text
10.1016/j.jcss.2020.04.004
Montealegre_etal2020
Journal Of Computer And System Sciences
J. Comput. Syst. Sci.
2020
Academic Press Inc Elsevier Science
continuing
periodical
academic journal
113
1
17
0022-0000