- Conference Paper
Rights / licenseCreative Commons Attribution 3.0 Unported
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. Show more
Richa, Andrea W.
Book title31st International Symposium on Distributed Computing (DISC 2017)
Journal / seriesLeibniz International Proceedings in Informatics
Pages / Article No.
PublisherSchloss Dagstuhl-Leibniz-Zentrum fuer Informatik
SubjectDistributed Graph Algorithms; Degree Splitting; Edge Coloring; Discrepancy
Organisational unit00002 - ETH Zürich
09587 - Ghaffari, Mohsen / Ghaffari, Mohsen
MoreShow all metadata