Deterministic near-optimal distributed listing of cliques
Name
446_2024_470_ReferencePDF.pdf
Size
1.41 MB
Format
Adobe PDF
Checksum (MD5)
8b50b1edd51271ecd2b44b92f43c5483
Author(s)
Censor-Hillel, Keren
Leitersdorf, Dean
Vulakh, David
Date Issued
June 20, 2024
Journal
Distributed Computing
Publisher
Springer Berlin Heidelberg
Citation
Censor-Hillel, K., Leitersdorf, D. & Vulakh, D. Deterministic near-optimal distributed listing of cliques. Distrib. Comput. 37, 363–385 (2024).
Version
Author's final manuscript
Abstract
The importance of classifying connections in large graphs has been the motivation for a rich line of work on distributed subgraph finding that has led to exciting recent breakthroughs. A crucial aspect that remained open was whether deterministic algorithms can be as efficient as their randomized counterparts, where the latter are known to be tight up to polylogarithmic factors. We give deterministic distributed algorithms for listing cliques of size p in n 1 - 2 / p + o ( 1 ) rounds in the Congest model. For triangles, our n 1 / 3 + o ( 1 ) round complexity improves upon the previous state of the art of n 2 / 3 + o ( 1 ) rounds (Chang and Saranurak, in: 2020 IEEE 61st annual symposium on foundations of computer science (FOCS), pp 377–388. IEEE Computer Society, Los Alamito, 2020. https://doi.org/10.1109/FOCS46700.2020.00043 ). For cliques of size p ≥ 4 , ours are the first non-trivial deterministic distributed algorithms. Given known lower bounds, for all values p ≥ 3 our algorithms are tight up to an n o ( 1 ) subpolynomial factor, which comes from the deterministic routing procedure we use.
Description
This article is part of a collection for a Special Issue of Distributed Computing: by invitation only, this special issue highlights the best papers from the ACM Symposium on Principles of Distributed Computing (PODC 2022) held in Salerno, Italy, on July 25-29 2022.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00446-024-00470-8
