Two rounds are enough for reconstructing any graph (Class) in the congested clique model
Más información
| Título según SCOPUS: | Two rounds are enough for reconstructing any graph (Class) in the congested clique model |
| Título de la Revista: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volumen: | 11085 |
| Editorial: | Springer |
| Fecha de publicación: | 2018 |
| Página de inicio: | 134 |
| Página final: | 148 |
| Idioma: | English |
| DOI: |
10.1007/978-3-030-01325-7_15 |
| Notas: | SCOPUS |