Abstract
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 discrepancy. The directed variant of the problem requires orienting the edges such that each node has almost the same number of incoming and outgoing edges, again up to a small additive discrepancy. We present deterministic distributed algorithms for both variants, which improve on their counterparts presented by Ghaffari and Su (Proc SODA 2017:2505–2523, 2017): our algorithms are significantly simpler and faster, and have a much smaller discrepancy. This also leads to a faster and simpler deterministic algorithm for (2+o(1))Δ-edge-coloring, improving on that of Ghaffari and Su.
Originalsprache | englisch |
---|---|
Seiten (von - bis) | 293-310 |
Fachzeitschrift | Distributed Computing |
Jahrgang | 33 |
Ausgabenummer | 3-4 |
DOIs | |
Publikationsstatus | Veröffentlicht - 2020 |
Extern publiziert | Ja |