Improved distributed degree splitting and edge coloring
- Swiss Federal Institute of Technology Zurich
- University of Freiburg
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.
|Tila||Sähköinen julkaisu (e-pub) ennen painettua julkistusta - 4 helmikuuta 2019|
|OKM-julkaisutyyppi||A1 Julkaistu artikkeli, soviteltu|