On Distributed Listing of Cliques

DOI10.1145/3382734.3405742MaRDI QIDQ5854055zbMATH OpenOpenAlexWikidataFDO

Authors Keren Censor-Hillel, François Le Gall, 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)

Cited in

(8)

• Near-optimal scheduling in the congested clique
• A note on improved results for one round distributed clique listing
• The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
• Distributed discovery of large near-cliques
• Deterministic near-optimal distributed listing of cliques
• Deterministic expander routing: faster and more versatile
• Distributed subgraph finding: progress and challenges (invited talk)
• Narrowing the \textsf{LOCAL-CONGEST} gaps in sparse networks via expander decompositions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5854055)