Cited By
View all- Halldórsson MRawitz D(2024)Distributed Fractional Local Ratio and Independent Set ApproximationInformation and Computation10.1016/j.ic.2024.105238(105238)Online publication date: Dec-2024
Distributed Symmetry Breaking on Power Graphs via Sparsification
Pages 157 - 167
Abstract
In this paper we present efficient distributed algorithms for classical symmetry breaking problems, maximal independent sets (MIS) and ruling sets, in power graphs. We work in the standard CONGEST model of distributed message passing, where the communication network is abstracted as a graph G. Typically, the problem instance in CONGEST is identical to the communication network G, that is, we perform the symmetry breaking in G. In this work, we consider a setting where the problem instance corresponds to a power graph Gk, where each node of the communication network G is connected to all of its k-hop neighbors.
A β-ruling set is a set of non-adjacent nodes such that each node in G has a ruling neighbor within β hops; a natural generalization of an MIS. On top of being a natural family of problems, ruling sets (in power graphs) are well-motivated through their applications in the powerful shattering framework [BEPS JACM'16, Ghaffari SODA'19] (and others). We present randomized algorithms for computing maximal independent sets and ruling sets of Gk in essentially the same time as they can be computed in G. Our main contribution is a deterministic poly(k, log n) time algorithm for computing k-ruling sets of Gk, which (for k > 1) improves exponentially on the current state-of-the-art runtimes. Our main technical ingredient for this result is a deterministic sparsification procedure which may be of independent interest.
We also revisit the shattering algorithm for MIS [BEPS J'ACM'16] and present different approaches for the post-shattering phase. Our solutions are algorithmically and analytically simpler (also in the LOCAL model) than existing solutions and obtain the same runtime as [Ghaffari SODA'16].
References
[1]
Kook Jin Ahn, Graham Cormode, Sudipto Guha, Andrew McGregor, and Anthony Wirth. 2021. Correlation Clustering in Data Streams. Algorithmica 83, 7 (2021), 1980--2017.
[2]
Kook Jin Ahn, Sudipto Guha, and Andrew McGregor. 2012. Graph Sketches: Sparsification, Spanners, and Subgraphs. In Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS). 5--14.
[3]
Noga Alon and Sepehr Assadi. 2020. Palette Sparsification Beyond (Δ+1) Vertex Coloring. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020. 6:1--6:22.
[4]
Noga Alon, László Babai, and Alon Itai. 1986. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. Journal of Algorithms 7, 4 (1986), 567--583.
[5]
Sepehr Assadi, Yu Chen, and Sanjeev Khanna. 2019. Sublinear Algorithms for (Δ + 1) Vertex Coloring. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6--9, 2019, Timothy M. Chan (Ed.). SIAM, 767--786.
[6]
Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, and Serge A. Plotkin. 1989. Network decomposition and locality in distributed computation. In Proceedings of the Symposium on Foundations of Computer Science (FOCS). 364--369.
[7]
Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, and Jara Uitto. 2022. Exponential Speedup Over Locality in MPC with Optimal Memory. In Proceedings of the International Symposium on Distributed Computing (DISC). 9:1--9:21.
[8]
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, and Dennis Olivetti. 2022. Distributed Δ-coloring plays hide-and-seek. In STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 -- 24, 2022, Stefano Leonardi and Anupam Gupta (Eds.). ACM, 464--477.
[9]
Alkida Balliu, Sebastian Brandt, and Dennis Olivetti. 2022. Distributed Lower Bounds for Ruling Sets. SIAM J. Comput. 51, 1 (2022), 70--115.
[10]
Philipp Bamberger, Fabian Kuhn, and Yannic Maus. 2020. Efficient Deterministic Distributed Coloring with Small Bandwidth. In PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3--7, 2020, Yuval Emek and Christian Cachin (Eds.). ACM, 243--252.
[11]
Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, and Sriram V. Pemmaraju. 2020. Distributed Approximation on Power Graphs. In Proceedings of the 39th Symposium on Principles of Distributed Computing (Virtual Event, Italy) (PODC '20). Association for Computing Machinery, New York, NY, USA, 501--510.
[12]
Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider. 2016. The Locality of Distributed Symmetry Breaking. J. ACM 63, 3, Article 20 (jun 2016), 45 pages. http://arxiv.org/abs/1202.1983.
[13]
Tushar Bisht, Kishore Kothapalli, and Sriram V. Pemmaraju. 2014. Brief announcement: Super-fast t-ruling sets. In ACM Symposium on Principles of Distributed Computing, PODC '14, Paris, France, July 15--18, 2014, Magnús M. Halldórsson and Shlomi Dolev (Eds.). ACM, 379--381.
[14]
Sebastian Brandt. 2019. An Automatic Speedup Theorem for Distributed Problems. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC), Peter Robinson and Faith Ellen (Eds.). ACM, 379--388.
[15]
Keren Censor-Hillel, Merav Parter, and Gregory Schwartzman. 2017. Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. In 31st Int. Symp. on Distributed Computing (DISC).
[16]
Yi-Jun Chang, Wenzheng Li, and Seth Pettie. 2020. Distributed (Δ+1)-Coloring via Ultrafast Graph Shattering. SIAM J. Comput. 49, 3 (2020), 497--539.
[17]
Yi-Jun Chang, Manuela Fischer, Mohsen Ghaffari, Jara Uitto, and Yufan Zheng. 2019. The Complexity of (Δ + 1)-Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC). 471--480.
[18]
Kai-Min Chung, Seth Pettie, and Hsin-Hao Su. 2017. Distributed algorithms for the Lovász local lemma and graph coloring. Distributed Comput. 30, 4 (2017), 261--280.
[19]
Artur Czumaj, Peter Davies, and Merav Parter. 2020. Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (Virtual Event, USA) (SPAA '20). Association for Computing Machinery, New York, NY, USA, 175--185.
[20]
Artur Czumaj, Peter Davies, and Merav Parter. 2021. Improved Deterministic (Δ+1) Coloring in Low-Space MPC. In PODC '21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26--30, 2021, Avery Miller, Keren Censor-Hillel, and Janne H. Korhonen (Eds.). ACM, 469--479.
[21]
Janosch Deurer, Fabian Kuhn, and Yannic Maus. 2019. Deterministic Distributed Dominating Set Approximation in the CONGEST Model. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 -- August 2, 2019, Peter Robinson and Faith Ellen (Eds.). ACM, 94--103.
[22]
Michael Dinitz and Yasamin Nazari. 2020. Massively Parallel Approximate Distance Sketches. In 23rd International Conference on Principles of Distributed Systems (OPODIS 2019). 35:1--35:17.
[23]
Michal Dory, Orr Fischer, Seri Khoury, and Dean Leitersdorf. 2021. Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (PODC). 223--233.
[24]
Michael Elkin and Shaked Matar. 2019. Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 -- August 2, 2019, Peter Robinson and Faith Ellen (Eds.). ACM, 531--540.
[25]
Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, and Václav Rozhoň. 2022. Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond.
[26]
Manuela Fischer and Mohsen Ghaffari. 2017. Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy. In 31st International Symposium on Distributed Computing, DISC 2017, October 16--20, 2017, Vienna, Austria (LIPIcs), Andréa W. Richa (Ed.), Vol. 91. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 18:1--18:16.
[27]
Manuela Fischer, Yannic Maus, and Magnús M. Halldórsson. 2022. Fast Distributed Brooks' Theorem. CoRR abs/2211.07606 (2022). arXiv:2211.07606
[28]
Sebastian Forster, Martin Grösbacher, and Tijn de Vos. 2022. An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). 16:1--16:17.
[29]
Pierre Fraigniaud, Magnús M. Halldórsson, and Alexandre Nolin. 2020. Distributed Testing of Distance-k Colorings. In Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 -- July 1, 2020, Proceedings (Lecture Notes in Computer Science), Andrea Werneck Richa and Christian Scheideler (Eds.), Vol. 12156. Springer, 275--290.
[30]
Beat Gfeller and Elias Vicari. 2007. A Randomized Distributed Algorithm for the Maximal Independent Set Problem in Growth-Bounded Graphs. In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing (Portland, Oregon, USA) (PODC '07). Association for Computing Machinery, New York, NY, USA, 53--60.
[31]
Mohsen Ghaffari. 2016. An Improved Distributed Algorithm for Maximal Independent Set. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10--12, 2016, Robert Krauthgamer (Ed.). SIAM, 270--277.
[32]
Mohsen Ghaffari. 2017. Distributed MIS via All-to-All Communication. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC). 141--149.
[33]
Mohsen Ghaffari. 2019. Distributed Maximal Independent Set using Small Messages. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6--9, 2019, Timothy M. Chan (Ed.). SIAM, 805--820.
[34]
Mohsen Ghaffari. 2022. Local Computation of Maximal Independent Set. In 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 -- November 3, 2022. IEEE, 438--449.
[35]
Mohsen Ghaffari, Themis Gouleakis, Christian Konrad, Slobodan Mitrovic, and Ronitt Rubinfeld. 2018. Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC). 129--138.
[36]
Mohsen Ghaffari, David G. Harris, and Fabian Kuhn. 2018. On Derandomizing Local Distributed Algorithms. In 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7--9, 2018, Mikkel Thorup (Ed.). IEEE Computer Society, 662--673.
[37]
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, and Yannic Maus. 2021. Improved distributed Δ-coloring. Distributed Comput. 34, 4 (2021), 239--258.
[38]
Mohsen Ghaffari and Fabian Kuhn. 2021. Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition. In Proceedings of the Symposium on Foundations of Computer Science (FOCS). 1009--1020.
[39]
Mohsen Ghaffari, Fabian Kuhn, and Yannic Maus. 2017. On the complexity of local distributed graph problems. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19--23, 2017, Hamed Hatami, Pierre McKenzie, and Valerie King (Eds.). ACM, 784--797.
[40]
Mohsen Ghaffari and Jara Uitto. 2019. Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA).
[41]
Magnús M. Halldórsson, Fabian Kuhn, and Yannic Maus. 2020. Distance-2 Coloring in the CONGEST Model. In PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3--7, 2020, Yuval Emek and Christian Cachin (Eds.). ACM, 233--242.
[42]
Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, and Alexandre Nolin. 2020. Coloring Fast Without Learning Your Neighbors' Colors. In 34th International Symposium on Distributed Computing, DISC 2020, October 12--16, 2020, Virtual Conference (LIPIcs), Hagit Attiya (Ed.), Vol. 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 39:1--39:17.
[43]
Magnús M. Halldórsson and Alexandre Nolin. 2021. Superfast Coloring in CONGEST via Efficient Color Sampling. In Structural Information and Communication Complexity - 28th International Colloquium, SIROCCO 2021, Wrocław, Poland, June 28 -- July 1, 2021, Proceedings (Lecture Notes in Computer Science), Tomasz Jurdzinski and Stefan Schmid (Eds.), Vol. 12810. Springer, 68--83.
[44]
James W. Hegeman, Gopal Pandurangan, Sriram V. Pemmaraju, Vivek B. Sardeshmukh, and Michele Scquizzato. 2015. Toward Optimal Bounds in the Congested Clique:Graph Connectivity and MST. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC). 91--100.
[45]
Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. 2021. A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths. SIAM J. Comput. 50, 3 (2021).
[46]
Tomasz Jurdziński and Krzysztof Nowicki. 2018. MST in O(1) Rounds of Congested Clique. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA). 2620--2632.
[47]
Amos Korman, Jean-Sébastien Sereni, and Laurent Viennot. 2013. Toward more localized local algorithms: removing assumptions concerning global knowledge. Distributed Comput. 26, 5--6 (2013), 289--308.
[48]
Kishore Kothapalli and Sriram V. Pemmaraju. 2012. Super-Fast 3-Ruling Sets. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15--17, 2012, Hyderabad, India (LIPIcs), Deepak D'Souza, Telikepalli Kavitha, and Jaikumar Radhakrishnan (Eds.), Vol. 18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 136--147.
[49]
Sven Oliver Krumke, Madhav V. Marathe, and S. S. Ravi. 2001. Models and Approximation Algorithms for Channel Assignment in Radio Networks. Wirel. Networks 7, 6 (2001), 575--584.
[50]
Fabian Kuhn, Yannic Maus, and Simon Weidner. 2018. Deterministic Distributed Ruling Sets of Line Graphs. In Structural Information and Communication Complexity - 25th International Colloquium, SIROCCO 2018, Ma'ale HaHamisha, Israel, June 18--21, 2018, Revised Selected Papers (Lecture Notes in Computer Science), Zvi Lotker and Boaz Patt-Shamir (Eds.), Vol. 11085. Springer, 193--208.
[51]
Christoph Lenzen and Roger Wattenhofer. 2010. Brief Announcement: Exponential Speed-up of Local Algorithms Using Non-Local Communication. In Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC). 295--296.
[52]
Nati Linial. 1992. Locality in Distributed Graph Algorithms. SIAM J. Comput. 21, 1 (1992), 193--201.
[53]
Michael Luby. 1986. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Comput. 15 (11 1986), 1036--1053.
[54]
Yannic Maus, Saku Peltonen, and Jara Uitto. 2023. Distributed Symmetry Breaking on Power Graphs via Sparsification. arXiv:2302.06878 [cs.DS]
[55]
Krzysztof Nowicki. 2021. A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique. In Proceedings of the ACM Symposium on Theory of Computing (STOC). 1154--1165.
[56]
David Peleg. 2000. Distributed computing : a locality sensitive approach. SIAM.
[57]
Václav Rozhoň and Mohsen Ghaffari. 2020. Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Chicago, IL, USA) (STOC 2020). Association for Computing Machinery, New York, NY, USA, 350--363.
[58]
Jeanette P. Schmidt, Alan Siegel, and Aravind Srinivasan. 1995. Chernof-Hoeffding Bounds for Applications with Limited Independence. SIAM Journal on Discrete Mathematics 8, 2 (1995), 223--250.
[59]
Johannes Schneider, Michael Elkin, and Roger Wattenhofer. 2013. Symmetry breaking depending on the chromatic number or the neighborhood growth. Theoretical Computer Science 509 (10 2013).
[60]
Salil P. Vadhan. 2012. Pseudorandomness. Now Publishers. https://books.google.fi/books?id=iam4lAEACAAJ
Index Terms
- Distributed Symmetry Breaking on Power Graphs via Sparsification
Recommendations
Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets
PODC '17: Proceedings of the ACM Symposium on Principles of Distributed ComputingWe study local symmetry breaking problems in the Congest model, focusing on ruling set problems, which generalize the fundamental Maximal Independent Set (MIS) problem. Our work is motivated by the following central question: can we break the long-...
The Locality of Distributed Symmetry Breaking
FOCS '12: Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer ScienceWe present new bounds on the locality of several classical symmetry breaking tasks in distributed networks. A sampling of the results include \begin{enumerate} \item A randomized algorithm for computing a maximal matching (MM) in $O(\log\Delta + (\log\...
Node and Edge Averaged Complexities of Local Graph Problems
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed ComputingWe continue the recently started line of work on the distributed node-averaged complexity of distributed graph algorithms. The node-averaged complexity of a distributed algorithm running on a graph G=(V,E) is the average over the times at which the ...
Comments
Information & Contributors
Information
Published In
June 2023
392 pages
ISBN:9798400701214
DOI:10.1145/3583668
- Chair:
- Rotem Oshman,
- Proceedings Editor:
- Alexandre Nolin,
- Program Chair:
- Magnus Mar Halldorsson,
- Workshop Chair:
- Alkida Balliu
Copyright © 2023 Owner/Author(s).
This work is licensed under a Creative Commons Attribution International 4.0 License.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 16 June 2023
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
PODC '23: 2023 ACM Symposium on Principles of Distributed Computing
June 19 - 23, 2023
FL, Orlando, USA
Acceptance Rates
PODC '23 Paper Acceptance Rate 29 of 110 submissions, 26%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 207Total Downloads
- Downloads (Last 12 months)135
- Downloads (Last 6 weeks)8
Reflects downloads up to 28 Dec 2024
Other Metrics
Citations
Cited By
View all- Halldórsson MRawitz D(2024)Distributed Fractional Local Ratio and Independent Set ApproximationInformation and Computation10.1016/j.ic.2024.105238(105238)Online publication date: Dec-2024
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in