1 citations · 1 across the 5 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Distributed -Coloring in Rounds
Marc Fuchs, Fabian Kuhn
We give a deterministic distributed algorithm for -coloring an -node graph of maximum degree in rounds in both the LOCAL and CONGEST models. More…
cs.DS2025
On the Complexity of Distributed Edge Coloring and Orientation Problems
Sebastian Brandt, Fabian Kuhn, Zahra Parsaeian
Understanding the role of randomness when solving locally checkable labeling (LCL) problems in the LOCAL model has been one of the top priorities in the research on distributed gra…
cs.DS2024★ 1 cited
Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms
Marc Fuchs, Fabian Kuhn
In this paper, we give list coloring variants of simple iterative defective coloring algorithms. Formally, in a list defective coloring instance, each node of a graph is given…