research-article

Overcoming Congestion in Distributed Coloring

Authors:

Magnús M. Halldórsson,

Alexandre Nolin,

Tigran TonoyanAuthors Info & Claims

PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing

Pages 26 - 36

https://doi.org/10.1145/3519270.3538438

Published: 21 July 2022 Publication History

Abstract

We present a new technique to efficiently sample and communicate a large number of elements from a distributed sampling space. When used in the context of a recent Local algorithm for (degree +1)-list-coloring (D1LC), this allows us to solve D1LC in O(log5 logn) Congest rounds, and in only O(log* n) rounds when the graph has minimum degree Ω(log7 n), w.h.p.

The technique also has immediate applications in testing some graph properties locally, and for estimating the sparsity/density of local subgraphs in O(1) Congest rounds, w.h.p.

Supplementary Material

MP4 File (S1-T3.mp4)

Presentation video

Download
921.61 MB

References

[1]

Noga Alon and Sepehr Assadi. 2020. Palette Sparsification Beyond ( + 1) Vertex Coloring. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM) (LIPIcs, Vol. 176). LZI, 6:1--6:22. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.6

[2]

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. https://doi.org/10.1016/0196--6774(86)90019--2

Digital Library

[3]

Andris Ambainis. 1996. Communication Complexity in a 3-Computer Model. Algorithmica 16, 3 (1996), 298--301. https://doi.org/10.1007/BF01955678

[4]

Sepehr Assadi, Yu Chen, and Sanjeev Khanna. 2019. Sublinear algorithms for ( + 1) vertex coloring. In Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA). SIAM, 767--786. https://doi.org/10.1137/1.9781611975482.48

[5]

Leonid Barenboim. 2016. Deterministic -Coloring in Sublinear (in ) Time in Static, Dynamic, and Faulty Networks. Journal of the ACM 63, 5 (2016), 47:1--47:22. https://doi.org/10.1145/2979675

Digital Library

[6]

Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider. 2016. The Locality of Distributed Symmetry Breaking. Journal of the ACM 63, 3 (2016), 20:1--20:45. https://doi.org/10.1145/2903137

Digital Library

[7]

Zvika Brakerski and Boaz Patt-Shamir. 2011. Distributed discovery of large nearcliques. Distributed Computing 24, 2 (2011), 79--89. https://doi.org/10.1007/s00446- 011-0132-x

[8]

Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, and Yadu Vasudev. 2019. Fast distributed algorithms for testing graph properties. Distributed Computing 32, 1 (2019), 41--57. https://doi.org/10.1007/s00446-018-0324--8

[9]

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 Proc. ACM Symp. on Principles of Distributed Computing (PODC). ACM, 471--480. https://doi.org/10.1145/ 3293611.3331607

Digital Library

[10]

Yi-Jun Chang, Wenzheng Li, and Seth Pettie. 2020. Distributed ( + 1)-Coloring via Ultrafast Graph Shattering. SIAM Journal on Computing 49, 3 (2020), 497--539. https://doi.org/10.1137/19M1249527

Digital Library

[11]

Artur Czumaj, Peter Davies, and Merav Parter. 2021. Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC. SIAM Journal on Computing 50, 5 (2021), 1603--1626. https://doi.org/10.1137/20M1366502

Digital Library

[12]

Benjamin Doerr. 2020. Probabilistic Tools for the Analysis of Randomized Optimization Heuristics. Springer International Publishing, Cham, 1--87. https: //doi.org/10.1007/978--3-030--29414--4_1

[13]

Michael Elkin, Seth Pettie, and Hsin-Hao Su. 2015. (2 1)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting. In Proc. ACMSIAM Symp. on Discrete Algorithms (SODA). SIAM, 355--370. https://doi.org/10. 1137/1.9781611973730.26

[14]

Pierre Fraigniaud and Dennis Olivetti. 2019. Distributed Detection of Cycles. ACM Transactions on Parallel Computing (TOPC) 6, 3 (2019), 12:1--12:20. https: //doi.org/10.1145/3322811

Digital Library

[15]

Pierre Fraigniaud, Ivan Rapaport, Ville Salo, and Ioan Todinca. 2016. Distributed Testing of Excluded Subgraphs. In Proc. Int. Symp. on Distributed Computing (DISC) (LNCS, Vol. 9888). Springer, 342--356. https://doi.org/10.1007/978--3--662- 53426--7_25

[16]

Mohsen Ghaffari and Fabian Kuhn. 2021. Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition. In Proc. Symp. on Foundations of Computer Science (FOCS). IEEE, 1009--1020. https://doi.org/10. 1109/FOCS52979.2021.00101

[17]

Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, and Alexandre Nolin. 2020. Coloring Fast Without Learning Your Neighbors' Colors. In Proc. Int. Symp. on Distributed Computing (DISC) (LIPIcs, Vol. 179). LZI, 39:1--39:17. https://doi.org/ 10.4230/LIPIcs.DISC.2020.39

[18]

Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, and Tigran Tonoyan. 2021. Efficient randomized distributed coloring in CONGEST. In Proc. ACM Symp. on Theory of Computing (STOC). ACM, 1180--1193. https://doi.org/10.1145/3406325. 3451089

Digital Library

[19]

Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin, and Tigran Tonoyan. 2021. Near-Optimal Distributed Degree+1 Coloring. CoRR abs/2112.00604 (2021), 44 pages. https://doi.org/10.48550/arXiv.2112.00604

[20]

Magnús M. Halldórsson and Alexandre Nolin. 2021. Superfast Coloring in CONGEST via Efficient Color Sampling. In Proc. Int. Coll. on Structural Information and Communication Complexity (SIROCCO) (LNCS, Vol. 12810). Springer, 68--83. https://doi.org/10.1007/978--3-030--79527--6_5

[21]

Magnús M. Halldórsson, Alexandre Nolin, and Tigran Tonoyan. 2022. Overcoming Congestion in Distributed Coloring. CoRR abs/2205.14478 (2022), 30 pages. Full version of this paper.

[22]

David G. Harris, Johannes Schneider, and Hsin-Hao Su. 2018. Distributed ( + 1)- coloring in sublogarithmic rounds. Journal of the ACM 65, 4 (2018), 19:1--19:21. https://doi.org/10.1145/3178120

Digital Library

[23]

Öjvind Johansson. 1999. Simple Distributed +1-Coloring of Graphs. Information Processing Letters 70, 5 (1999), 229--232. https://doi.org/10.1016/S0020-0190(99) 00064--2

[24]

Nathan Linial. 1992. Locality in Distributed Graph Algorithms. SIAM Journal on Computing 21, 1 (1992), 193--201. https://doi.org/10.1137/0221015

Digital Library

[25]

Michael Luby. 1986. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM Journal on Computing 15, 4 (1986), 1036--1053. https://doi. org/10.1137/0215074

Digital Library

[26]

Michael Molloy and Bruce A. Reed. 1998. Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree. In Proc. Latin American Symp. on Theoretical Informatics (LATIN) (LNCS, Vol. 1380). Springer, 216--225. https: //doi.org/10.1007/BFb0054323

[27]

Ilan Newman. 1991. Private vs. Common Random Bits in Communication Complexity. Information Processing Letters 39, 2 (1991), 67--71. https://doi.org/10. 1016/0020-0190(91)90157-D

Digital Library

[28]

Bruce A. Reed. 1998., and . Journal of Graph Theory 27, 4 (1998), 177-- 212. https://doi.org/10.1002/(SICI)1097-0118(199804)27:4<177::AID-JGT1>3.0. CO;2-K

[29]

Johannes Schneider and RogerWattenhofer. 2010. Anewtechnique for distributed symmetry breaking. In Proc. ACM Symp. on Principles of Distributed Computing (PODC). ACM, 257--266. https://doi.org/10.1145/1835698.1835760

Digital Library

[30]

Salil P. Vadhan. 2012. Pseudorandomness. Foundations and Trends in Theoretical Computer Science 7, 1--3 (2012), 1--336. https://doi.org/10.1561/0400000010

Digital Library

Cited By

Coy SCzumaj ADavies-Peck PMishra G(2024)Parallel Derandomization for Coloring*2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS57955.2024.00098(1058-1069)Online publication date: 27-May-2024
https://doi.org/10.1109/IPDPS57955.2024.00098
Maus Y(2023)Distributed Graph Coloring Made EasyACM Transactions on Parallel Computing10.1145/360589610:4(1-21)Online publication date: 14-Dec-2023
https://dl.acm.org/doi/10.1145/3605896

Index Terms

Overcoming Congestion in Distributed Coloring
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph coloring
2. Theory of computation
  1. Design and analysis of algorithms
    1. Distributed algorithms

Recommendations

Distributed Edge Coloring in Time Polylogarithmic in Δ
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing

We provide new deterministic algorithms for the edge coloring problem, which is one of the classic and highly studied distributed local symmetry breaking problems. As our main result, we show that a (2Δ - 1)-edge coloring can be computed in time poly ...
Distance-2 Coloring in the CONGEST Model
PODC '20: Proceedings of the 39th Symposium on Principles of Distributed Computing

We give efficient randomized and deterministic distributed algorithms for computing a distance-2 vertex coloring of a graph G in the CONGEST model. In particular, if Δ is the maximum degree of G, we show that there is a randomized CONGEST model ...
Distributed Graph Coloring Made Easy
In this article, we present a deterministic \(\mathsf {CONGEST}\) algorithm to compute an O(kΔ)-vertex coloring in O(Δ /k)+log^* n rounds, where Δ is the maximum degree of the network graph and k≥ 1 can be freely chosen. The algorithm is extremely simple:...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing

July 2022

509 pages

ISBN:9781450392624

DOI:10.1145/3519270

General Chair:
Alessia Milani
Aix-Marseille University, France
,
Program Chair:
Philipp Woelfel
University of Calgary, Canada

Copyright © 2022 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 July 2022

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

PODC '22

Sponsor:

PODC '22: ACM Symposium on Principles of Distributed Computing

July 25 - 29, 2022

Salerno, Italy

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
99
Total Downloads

Downloads (Last 12 months)28
Downloads (Last 6 weeks)1

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Coy SCzumaj ADavies-Peck PMishra G(2024)Parallel Derandomization for Coloring*2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS57955.2024.00098(1058-1069)Online publication date: 27-May-2024
https://doi.org/10.1109/IPDPS57955.2024.00098
Maus Y(2023)Distributed Graph Coloring Made EasyACM Transactions on Parallel Computing10.1145/360589610:4(1-21)Online publication date: 14-Dec-2023
https://dl.acm.org/doi/10.1145/3605896

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents