Sam Coy
Parallel Derandomization for Coloring
Coy, Sam; Czumaj, Artur; Davies-Peck, Peter; Mishra, Gopinath
Authors
Abstract
Graph coloring problems are among the most fundamental problems in parallel and distributed computing, and have been studied extensively in both settings. In this context, designing efficient deterministic algorithms for these problems has been found particularly challenging. In this work we consider this challenge, and design a novel framework for derandomizing algorithms for coloring-type problems in the Massively Parallel Computation (MPC) model with sublinear space. We give an application of this framework by showing that a recent (degree + 1)-list coloring algorithm by Halldorsson et al. (STOC'22) in the LOCAL model of distributed computation can be translated to the MPC model and efficiently derandomized. Our algorithm runs in O(log log log n) rounds, which matches the complexity of the state of the art algorithm for the (∆ + 1)-coloring problem.
Citation
Coy, S., Czumaj, A., Davies-Peck, P., & Mishra, G. (in press). Parallel Derandomization for Coloring.
Conference Name | 38th IEEE International Parallel & Distributed Processing Symposium (IPDPS 2024) |
---|---|
Conference Location | San Francisco |
Start Date | May 27, 2024 |
End Date | May 31, 2024 |
Acceptance Date | Jan 31, 2024 |
Deposit Date | Feb 23, 2024 |
Publisher | Institute of Electrical and Electronics Engineers |
Keywords | Parallel algorithms; Graph coloring; Derandomization |
Public URL | https://durham-repository.worktribe.com/output/2272976 |
Publisher URL | https://ieeexplore.ieee.org/xpl/conhome/1800044/all-proceedings |
This file is under embargo due to copyright reasons.
You might also like
Optimal (degree+1)-Coloring in Congested Clique
(2023)
Conference Proceeding
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
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