Graph reconstruction in the congested clique-Reference-Cited by-同舟云学术

Graph reconstruction in the congested clique

Author:

Montealegre P.,Perez-Salazar S.,Rapaport I.,Todinca I.

Funder

CONICYT

FONDECYT

PAI + Convocatoria Nacional Subvención a la Incorporación en la Academia Año

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference35 articles.

1. Distance-hereditary graphs;Bandelt;J. Comb. Theory, Ser. B,1986

3. Adding a referee to an interconnection network: what can(not) be computed in one round;Becker,2011

4. Graph Classes: A Survey;Brandstädt,1999

5. Algebraic methods in the congested clique;Censor-Hillel,2015

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Brief Announcement: What Can We Compute in a Single Round of the Congested Clique?;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16

3. Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06