On Distributed Listing of Cliques

DOI10.1145/3382734.3405742OpenAlexW3046349810MaRDI QIDQ5854055

François Le Gall, Keren Censor-Hillel, Dean Leitersdorf

Publication date: 15 March 2021

Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.05316

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (3)

A note on improved results for one round distributed clique listing ⋮ The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs ⋮ Near-optimal scheduling in the congested clique

This page was built for publication: On Distributed Listing of Cliques