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

Celý popis

Podrobná bibliografie

Vydáno v:	Distributed computing Ročník 33; číslo 3-4; s. 293 - 310
Hlavní autoři:	Ghaffari, Mohsen, Hirvonen, Juho, Kuhn, Fabian, Maus, Yannic, Suomela, Jukka, Uitto, Jara
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2020 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!