Login / Signup
Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model.
Pedro Montealegre
Sebastian Perez-Salazar
Ivan Rapaport
Ioan Todinca
Published in:
SIROCCO (2018)
Keyphrases
</>
probabilistic model
computational model
formal model
probability distribution
mathematical model
neural network
dependency graph
feature selection
prior knowledge
experimental data
conceptual model
graph representation
graphical representation