Pages that link to "Item:Q2186818"
From MaRDI portal
The following pages link to Graph reconstruction in the congested clique (Q2186818):
Displaying 4 items.
- Two rounds are enough for reconstructing any graph (class) in the congested clique model (Q1713905) (← links)
- Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model (Q3460729) (← links)
- Deterministic size discovery and topology recognition in radio networks with short labels (Q6040656) (← links)
- Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs (Q6488452) (← links)