Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018
No file

Dates and versions

hal-03541376 , version 1 (24-01-2022)

Identifiers

Cite

Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca. Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model. Structural Information and Communication Complexity (SIROCCO), 2018, Ma'ale HaHamisha, Israel. pp.134-148, ⟨10.1007/978-3-030-01325-7_15⟩. ⟨hal-03541376⟩
15 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More