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

Full description

Bibliographic Details

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