research-article

Improved Distributed Delta-Coloring

Authors:

Mohsen Ghaffari,

Yannic MausAuthors Info & Claims

PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing

Pages 427 - 436

https://doi.org/10.1145/3212734.3212764

Published: 23 July 2018 Publication History

Abstract

We present a randomized distributed algorithm that computes a Δ- coloring in any non-complete graph with maximum degree Δ ≥ 4 in O(log Δ) +2O( √ log log n) rounds, as well as a randomized algorithm that computes a Δ-coloring in O((log logn)2) rounds when Δ ε [3,O(1)]. Both these algorithms improve on an O(log3 n/ log Δ)- round algorithm of Panconesi and Srinivasan [STOC'1993], which has remained the state of the art for the past 25 years. Moreover, the latter algorithm gets (exponentially) closer to an Ω(log logn) round lower bound of Brandt et al. [STOC'16].

References

[1]

Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, and Louis Esperet. 2018. Distributed coloring in sparse graphs with fewer colors. In Proc. 37th ACM Symposium on Principles of Distributed Computing (PODC 2018). To appear.

Digital Library

[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.

Digital Library

[3]

B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin. 1989. Network Decomposition and Locality in Distributed Computation. In Proc. 30th Symposium on Foundations of Computer Science (FOCS 1989). 364--369.

Digital Library

[4]

Leonid Barenboim and Michael Elkin. 2013. Distributed graph coloring: Fundamentals and recent developments. Synthesis Lectures on Distributed Computing Theory 4, 1 (2013), 1--171.

Digital Library

[5]

Leonid Barenboim, Michael Elkin, and Uri Goldenberg. 2018. Locally-Iterative Distributed (Δ + 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models. In Proc. 37th ACM Symposium on Principles of Distributed Computing (PODC 2018). To appear.

Digital Library

[6]

Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider. 2012. The Locality of Distributed Symmetry Breaking. In Proc. 53rd Symposium on Foundations of Computer Science (FOCS 2012). 321--330.

Digital Library

[7]

Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider. 2016. The Locality of Distributed Symmetry Breaking. Journal of the ACM 63, 3, Article 20 (2016), 45 pages.

Digital Library

[8]

J.A. Bondy and U. Murty. 1976. Graph Theory with Applications. Elsevier.

Digital Library

[9]

Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, and Jara Uitto. 2016. A lower bound for the distributed Lovász local lemma. In Proc. 48th ACM Symposium on Theory of Computing (STOC 2016). ACM, 479--488.

Digital Library

[10]

Rowland Leonard Brooks. 2009. On colouring the nodes of a network. In Classic papers in combinatorics. Springer, 118--121.

[11]

Yi-Jun Chang, Tsvi Kopelowitz, and Seth Pettie. 2016. An exponential separation between randomized and deterministic complexity in the local model. In Proc. 57th Symposium on Foundations of Computer Science (FOCS 2016). IEEE, 615--624.

[12]

Yi-Jun Chang, Wenzheng Li, and Seth Pettie. 2018. An Optimal Distributed (Δ+1)- Coloring Algorithm?. In Proc. 50th ACM Symposium on Theory of Computing (STOC 2018). To appear.

Digital Library

[13]

Paul Erd's, Arthur Rubin, and Herbert Taylor. 1979. Choosability in Graphs. In Proc. West Coast Conference on Combinatorics, Graph Theory and Computing, Vol. 26. Congressus Numerantium, 125--157.

[14]

Manuela Fischer and Mohsen Ghaffari. 2017. Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy. In Proc. 31st International Symposium on Distributed Computing (DISC 2017) (LIPIcs), Vol. 91. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 18:1--18:16.

[15]

Pierre Fraigniaud, Marc Heinrich, and Adrian Kosowski. 2016. Local Conflict Coloring. In Proc. 57th Symposium on Foundations of Computer Science (FOCS 2016). 625--634.

[16]

Beat Gfeller and Elias Vicari. 2007. A Randomized Distributed Algorithm for the Maximal Independent Set Problem in Growth-bounded Graphs. In Proc. 26th ACM Symposium on Principles of Distributed Computing (PODC 2007). ACM, New York, NY, USA, 53--60.

Digital Library

[17]

Mohsen Ghaffari. 2016. An Improved Distributed Algorithm for Maximal Independent Set. In Proc. 27th ACM-SIAM Symposium on Discrete Algorithms (SODA 2016). 270--277.

Digital Library

[18]

Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, and Yannic Maus. 2018. Improved Distributed Δ-Coloring. CoRR abs/1803.03248 (2018).

[19]

Mohsen Ghaffari, Fabian Kuhn, and Yannic Maus. 2017. On the complexity of local distributed graph problems. In Proc. 49th ACM Symposium on Theory of Computing (STOC 2017). ACM, 784--797.

Digital Library

[20]

Mohsen Ghaffari and Hsin-Hao Su. 2017. Distributed degree splitting, edge coloring, and orientations. In Proc. 28th ACM-SIAM Symposium on Discrete Algorithms (SODA 2017). Society for Industrial and Applied Mathematics, 2505--2523.

Digital Library

[21]

David G Harris, Johannes Schneider, and Hsin-Hao Su. 2016. Distributed (Δ + 1)- coloring in sublogarithmic rounds. In Proc. 48th ACM Symposium on Theory of Computing (STOC 2016). ACM, 465--478.

Digital Library

[22]

Nati Linial. 1992. Locality in Distributed Graph Algorithms. SIAM J. Comput. 21, 1 (1992), 193--201.

Digital Library

[23]

László Lovász. 1975. Three short proofs in graph theory. Journal of Combinatorial Theory, Series B 19, 3 (1975), 269--271.

[24]

Michael Luby. 1986. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15, 4 (1986), 1036--1053.

Digital Library

[25]

Michael Molloy and Bruce Reed. 2013. Graph colouring and the probabilistic method. Vol. 23. Springer Science & Business Media.

[26]

Alessandro Panconesi and Aravind Srinivasan. 1992. Improved distributed algorithms for coloring and network decomposition problems. In Proc. 24th ACM Symposium on Theory of Computing (STOC 1992). ACM, 581--592.

Digital Library

[27]

Alessandro Panconesi and Aravind Srinivasan. 1995. The local nature of Δ- coloring and its algorithmic applications. Combinatorica 15, 2 (1995), 255--280.

[28]

David Peleg. 2000. Distributed computing. SIAM Monographs on discrete mathematics and applications 5 (2000).

[29]

Johannes Schneider, Michael Elkin, and Roger Wattenhofer. 2013. Symmetry breaking depending on the chromatic number or the neighborhood growth. Theoretical Computer Science 509 (2013), 40--50.

Digital Library

[30]

Vadim Vizing. 1976. Vextex coloring with given colors. Metody Diskretn. Anal. (1976), 29:3--10.

Cited By

Maus Y(2023)Distributed Graph Coloring Made EasyACM Transactions on Parallel Computing10.1145/360589610:4(1-21)Online publication date: 17-Aug-2023
https://dl.acm.org/doi/10.1145/3605896
Balliu ABrandt SKuhn FOlivetti DLeonardi SGupta A(2022)Distributed ∆-coloring plays hide-and-seekProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520027(464-477)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3520027
Balliu ABrandt SOlivetti D(2022)Distributed Lower Bounds for Ruling SetsSIAM Journal on Computing10.1137/20M138177051:1(70-115)Online publication date: 8-Feb-2022
https://doi.org/10.1137/20M1381770
Show More Cited By

Index Terms

Improved Distributed Delta-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

Near-optimal distributed degree+1 coloring
STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing

We present a new approach to randomized distributed graph coloring that is simpler and more efficient than previous ones. In particular, it allows us to tackle the (deg+1)-list-coloring (D1LC) problem, where each node v of degree d_v is assigned a ...
An optimal distributed (Δ+1)-coloring algorithm?
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing

Vertex coloring is one of the classic symmetry breaking problems studied in distributed computing. In this paper we present a new algorithm for (Δ+1)-list coloring in the randomized LOCAL model running in O(log^∗n + Det_d(poly logn)) time, where Det_d(n′) ...
Improved distributed $Δ$ -coloring
Abstract
We present a randomized distributed algorithm that computes a $Δ$ -coloring in any non-complete graph with maximum degree $Δ \geq 4$ in $O (log Δ) + 2^{O (\sqrt{log log n})}$ rounds, as well as a randomized algorithm that computes a $Δ$ -coloring in $O ({(log log n)}^{2})$ rounds when $Δ \in [...$ $^{}$

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing

July 2018

512 pages

ISBN:9781450357951

DOI:10.1145/3212734

General Chairs:
Calvin Newport
Georgetown University, USA
,
Idit Keidar
Technion, Israel

Copyright © 2018 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].

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 July 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

European Research Council
Ulla Tuominen Foundation

Conference

PODC '18

PODC '18: ACM Symposium on Principles of Distributed Computing

July 23 - 27, 2018

Egham, United Kingdom

Acceptance Rates

PODC '18 Paper Acceptance Rate 41 of 163 submissions, 25%;

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
172
Total Downloads

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

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Maus Y(2023)Distributed Graph Coloring Made EasyACM Transactions on Parallel Computing10.1145/360589610:4(1-21)Online publication date: 17-Aug-2023
https://dl.acm.org/doi/10.1145/3605896
Balliu ABrandt SKuhn FOlivetti DLeonardi SGupta A(2022)Distributed ∆-coloring plays hide-and-seekProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520027(464-477)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3520027
Balliu ABrandt SOlivetti D(2022)Distributed Lower Bounds for Ruling SetsSIAM Journal on Computing10.1137/20M138177051:1(70-115)Online publication date: 8-Feb-2022
https://doi.org/10.1137/20M1381770
Maus YTonoyan T(2022)Linial for listsDistributed Computing10.1007/s00446-022-00424-y35:6(533-546)Online publication date: 17-May-2022
https://doi.org/10.1007/s00446-022-00424-y
Zheng ZShi XHe LJin HWei SDai HPeng X(2021)Feluca: A Two-Stage Graph Coloring Algorithm With Color-Centric Paradigm on GPUIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2020.301417332:1(160-173)Online publication date: 1-Jan-2021
https://doi.org/10.1109/TPDS.2020.3014173
Maus Y(2020)The power of locality: Exploring the limits of randomness in distributed computingit - Information Technology10.1515/itit-2019-005162:5-6(271-278)Online publication date: 21-Jan-2020
https://doi.org/10.1515/itit-2019-0051
Rosenbaum WSuomela JEmek YCachin C(2020)Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph ProblemsProceedings of the 39th Symposium on Principles of Distributed Computing10.1145/3382734.3405721(89-98)Online publication date: 31-Jul-2020
https://dl.acm.org/doi/10.1145/3382734.3405721
Balliu ABrandt SOlivetti DSuomela JEmek YCachin C(2020)How much does randomness help with locally checkable problems?Proceedings of the 39th Symposium on Principles of Distributed Computing10.1145/3382734.3405715(299-308)Online publication date: 31-Jul-2020
https://dl.acm.org/doi/10.1145/3382734.3405715
Bamberger PKuhn FMaus YEmek YCachin C(2020)Efficient Deterministic Distributed Coloring with Small BandwidthProceedings of the 39th Symposium on Principles of Distributed Computing10.1145/3382734.3404504(243-252)Online publication date: 31-Jul-2020
https://dl.acm.org/doi/10.1145/3382734.3404504
Balliu ABrandt SOlivetti D(2020)Distributed Lower Bounds for Ruling Sets2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS46700.2020.00042(365-376)Online publication date: Nov-2020
https://doi.org/10.1109/FOCS46700.2020.00042
Show More Cited By

View Options

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