Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018
Fichier non déposé

Dates et versions

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

Identifiants

Citer

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 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More