Two rounds are enough for reconstructing any graph (class) in the congested clique model
From MaRDI portal
Publication:1713905
DOI10.1007/978-3-030-01325-7_15OpenAlexW2899034109MaRDI QIDQ1713905
Pedro Montealegre, Ioan Todinca, Sebastian Perez-Salazar, Ivan Rapaport
Publication date: 30 January 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-01325-7_15
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx)
Related Items