文章基本信息

标题：Improved Distributed Degree Splitting and Edge Coloring
本地全文：下载
作者：Mohsen Ghaffari ; Juho Hirvonen ; Fabian Kuhn 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：91
页码：19:1-19:15
DOI：10.4230/LIPIcs.DISC.2017.19
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Distributed Graph Algorithms; Degree Splitting; Edge Coloring; Discrepancy