Develops simpler list defective coloring algorithms leading to Õ(√Δ) round (Δ+1)-coloring in CONGEST and efficient coloring for low neighborhood independence graphs.
An optimal distributed ( \( \) +1)-coloring algorithm? In Proc.\ 50th ACM Symp.\ on Theory of Computing, (STOC) , pages 445--456, 2018
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms
Develops simpler list defective coloring algorithms leading to Õ(√Δ) round (Δ+1)-coloring in CONGEST and efficient coloring for low neighborhood independence graphs.