Two rounds are enough for reconstructing any graph (class) in the congested clique model (Q1713905)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two rounds are enough for reconstructing any graph (class) in the congested clique model |
scientific article; zbMATH DE number 7008453
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two rounds are enough for reconstructing any graph (class) in the congested clique model |
scientific article; zbMATH DE number 7008453 |
Statements
Two rounds are enough for reconstructing any graph (class) in the congested clique model (English)
0 references
30 January 2019
0 references
congested clique
0 references
round complexity
0 references
reconstruction problem
0 references
graph classes
0 references
hereditary graphs
0 references
