Improved distributed degree splitting and edge coloring

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 o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Distributed computing Jg. 33; H. 3-4; S. 293 - 310
Hauptverfasser: Ghaffari, Mohsen, Hirvonen, Juho, Kuhn, Fabian, Maus, Yannic, Suomela, Jukka, Uitto, Jara
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2020
Springer Nature B.V
Schlagworte:
Algorithms
Computer Communication Networks
Computer Hardware
Computer Science
Computer Systems Organization and Communication Networks
Graph coloring
Graph theory
Software Engineering/Programming and Operating Systems
Theory of Computation
Distributed graph algorithms
Degree splitting
Discrepancy
Edge coloring
ISSN:0178-2770, 1432-0452
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0178-2770
1432-0452
DOI:10.1007/s00446-018-00346-8