6 citations · 27 across the 32 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Deterministic Distributed Edge-Coloring with Fewer Colors
Mohsen Ghaffari, Fabian Kuhn, Yannic Maus +1
We present a deterministic distributed algorithm, in the LOCAL model, that computes a -edge-coloring in polylogarithmic-time, so long as the maximum degree $Δ=\tildeΩ(\l…
cs.DC2017★ 6 cited
Improved Distributed Degree Splitting and Edge Coloring
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn +3
The degree splitting problem requires coloring the edges of a graph red or blue such that each node has almost the same number of edges in each color, up to a small additive discre…