eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2017-10-12
19:1
19:15
10.4230/LIPIcs.DISC.2017.19
article
Improved Distributed Degree Splitting and Edge Coloring
Ghaffari, Mohsen
Hirvonen, Juho
Kuhn, Fabian
Maus, Yannic
Suomela, Jukka
Uitto, Jara
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 [SODA'17]: 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))Delta-edge-coloring, improving on that of Ghaffari and Su.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol091-disc2017/LIPIcs.DISC.2017.19/LIPIcs.DISC.2017.19.pdf
Distributed Graph Algorithms
Degree Splitting
Edge Coloring
Discrepancy