Sam Coy
Optimal (degree+1)-Coloring in Congested Clique
Coy, Sam; Czumaj, Artur; Davies, Peter; Mishra, Gopinath
Authors
Contributors
Kousha Etessami
Editor
Uriel Feige
Editor
Gabriele Puppis
Editor
Abstract
We consider the distributed complexity of the (degree+1)-list coloring problem, in which each node u of degree d(u) is assigned a palette of d(u) + 1 colors, and the goal is to find a proper coloring using these color palettes. The (degree+1)-list coloring problem is a natural generalization of the classical (Δ + 1)-coloring and (Δ + 1)-list coloring problems, both being benchmark problems extensively studied in distributed and parallel computing. In this paper we settle the complexity of the (degree+1)-list coloring problem in the Congested Clique model by showing that it can be solved deterministically in a constant number of rounds.
Citation
Coy, S., Czumaj, A., Davies, P., & Mishra, G. (2023). Optimal (degree+1)-Coloring in Congested Clique. In K. Etessami, U. Feige, & G. Puppis (Eds.), 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) (99:1-99:20). https://doi.org/10.4230/LIPIcs.ICALP.2023.46
Conference Name | ICALP 2023: 50th EATCS International Colloquium on Automata, Languages and Programming |
---|---|
Conference Location | Paderborn, Germany |
Start Date | Jul 10, 2023 |
End Date | Jul 14, 2023 |
Acceptance Date | Apr 21, 2021 |
Online Publication Date | Jul 5, 2023 |
Publication Date | 2023 |
Deposit Date | May 16, 2023 |
Publicly Available Date | May 16, 2023 |
Publisher | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
Volume | 261 |
Pages | 99:1-99:20 |
Series Title | Leibniz International Proceedings in Informatics (LIPIcs) |
Book Title | 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) |
ISBN | 9783959772785 |
DOI | https://doi.org/10.4230/LIPIcs.ICALP.2023.46 |
Public URL | https://durham-repository.worktribe.com/output/1134076 |
Publisher URL | https://dblp.org/db/conf/icalp/index.html |
Files
Published Conference Proceeding
(903 Kb)
PDF
Licence
http://creativecommons.org/licenses/by/4.0/
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
Copyright Statement
© Sam Coy, Artur Czumaj, Peter Davies, and Gopinath Mishra;
licensed under Creative Commons License CC-BY 4.0
50th International Colloquium on Automata, Languages, and Programming (ICALP 2023).
You might also like
Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization
(2023)
Conference Proceeding
Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring
(2023)
Conference Proceeding
Parallel Derandomization for Coloring
(2024)
Conference Proceeding
Component stability in low-space massively parallel computation
(2024)
Journal Article
Optimal Message-Passing with Noisy Beeps
(2023)
Conference Proceeding
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search