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

Full description

Bibliographic Details

Published in:	Distributed computing Vol. 33; no. 3-4; pp. 293 - 310
Main Authors:	Ghaffari, Mohsen, Hirvonen, Juho, Kuhn, Fabian, Maus, Yannic, Suomela, Jukka, Uitto, Jara
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2020 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!