Browsing by Author "c84685ed-b2b4-486f-9621-2a266580f981"

Now showing items 1-3 of 3

    • Graph reconstruction in the congested clique 
      Montealegre, P.; Pérez Salazar, S.; Rapaport Zimermann, Iván; Todinca, I. (Elsevier, 2020)
      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 ...
    • On Dissemination Thresholds in Regular and Irregular Graph Classes 
      Rapaport Zimermann, Iván; Suchan, K.; Todinca, I.; Verstraete, J. (Springer, 2011-01)
      We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active vertices are chosen independently with ...
    • The Impact of Locality in the Broadcast Congested Clique Model 
      Becker, F.; Montealecre, P.; Rapaport Zimermann, Iván; Todinca, I. (Siam, 2020)
      The broadcast congested clique model (BClique) is a message-passing model of distributed computation where n nodes communicate with each other in synchronous rounds. First, in this paper we prove that there is a one-round, ...