Towards Optimal Distributed Delta Coloring
- 24 May 2026
- book chapter
- Published by Springer Nature
- p. 391-410
Abstract
No abstract availableAll Related Versions
This publication has 26 references indexed in Scilit:
- Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS2024
- Parallel Derandomization for Coloring*2024
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model2016
- (2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting2014
- Symmetry breaking depending on the chromatic number or the neighborhood growthTheoretical Computer Science, 2013
- Some simple distributed algorithms for sparse networksDistributed Computing, 2001
- The local nature of ?-coloring and its algorithmic applicationsCombinatorica, 1995
- Locality in Distributed Graph AlgorithmsSIAM Journal on Computing, 1992
- A Lower Bound on Probabilistic Algorithms for Distributive Ring ColoringSIAM Journal on Discrete Mathematics, 1991
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941