Coloring Fast Without Learning Your Neighbors' Colors

@article{Halldrsson2020ColoringFW,
  title={Coloring Fast Without Learning Your Neighbors' Colors},
  author={M. Halld{\'o}rsson and F. Kuhn and Yannic Maus and Alexandre Nolin},
  journal={ArXiv},
  year={2020},
  volume={abs/2008.04303}
}
We give an improved randomized CONGEST algorithm for distance-$2$ coloring that uses $\Delta^2+1$ colors and runs in $O(\log n)$ rounds, improving the recent $O(\log \Delta \cdot \log n)$-round algorithm in [Halldorsson, Kuhn, Maus; PODC '20]. We then improve the time complexity to $O(\log \Delta) + 2^{O(\sqrt{\log\log n})}$. 
2 Citations

References

SHOWING 1-10 OF 41 REFERENCES
A and V
Coloring fast without learning your neighbors
  • 2020
Coloring fast without learning your neighbors' colors
  • 2020
Distributed Testing of Distance-k Colorings
Faster Deterministic Distributed Coloring Through Recursive List Coloring
  • F. Kuhn
  • Computer Science, Mathematics
  • SODA
  • 2020
...
1
2
3
4
5
...