Improved distributed Δ-coloring

We present a randomized distributed algorithm that computes a Δ -coloring in any non-complete graph with maximum degree Δ ≥ 4 in O ( log Δ ) + 2 O ( log log n ) rounds, as well as a randomized algorithm that computes a Δ -coloring in O ( ( log log n ) 2 ) rounds when Δ ∈ [ 3 , O ( 1 ) ] . Both these...

Celý popis

Podrobná bibliografia

Vydané v:	Distributed computing Ročník 34; číslo 4; s. 239 - 258
Hlavní autori:	Ghaffari, Mohsen, Hirvonen, Juho, Kuhn, Fabian, Maus, Yannic
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2021 Springer Nature B.V
Predmet:	Algorithms Coloring Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Lower bounds Software Engineering/Programming and Operating Systems Theory of Computation
ISSN:	0178-2770, 1432-0452
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!