Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
Open Access
- 9 June 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1937-1948
Abstract
No abstract availableAll Related Versions
Funding Information
- Research Council of Finland (359104)
- Research Council of Finland (363558)
- Icelandic Research Fund (2310015-053)
- Icelandic Research Fund (2511609)
- Austrian Science Fund (10.55776/P36280)
- Austrian Science Fund (10.55776/I6915)
This publication has 38 references indexed in Scilit:
- Superfast Coloring in CONGEST via Efficient Color Sampling2021
- On Derandomizing Local Distributed Algorithms2018
- Distributed algorithms for the Lovász local lemma and graph coloringDistributed Computing, 2016
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model2016
- Colouring graphs when the number of colours is almost the maximum degreeJournal of Combinatorial Theory, Series B, 2014
- On the Locality of Some NP-Complete Problems2012
- On Colouring the Nodes of a Network2009
- The Probabilistic Method2000
- The local nature of ?-coloring and its algorithmic applicationsCombinatorica, 1995
- Reducibility among Combinatorial Problems1972