Showing cs.DCShow all
2 papers · 1 filter
cs.DC2025
Faster Distributed -Coloring via a Reduction to MIS
Yann Bourreau, Sebastian Brandt, Alexandre Nolin
Recent improvements on the deterministic complexities of fundamental graph problems in the LOCAL model of distributed computing have yielded state-of-the-art upper bounds of $\tild…
cs.DC2023
Coloring Fast with Broadcasts
Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson +2
We present an -round distributed algorithm for the -coloring problem, where each node broadcasts only one -bit message per round to its neighbors…