Simple distributed Δ+1-coloring of graphs

A very natural randomized algorithm for distributed vertex coloring of graphs is analyzed. Under the assumption that the random choices of processors are mutually independent, the execution time will be O(log n) rounds almost always. A small modification of the algorithm is also proposed.

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters Jg. 70; H. 5; S. 229 - 232
1. Verfasser:	Johansson, Ojvind
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 21.06.1999 Elsevier Sequoia S.A
Schlagworte:	Algorithms Distributed computing Distributed processing Information processing Randomized algorithms Studies Vertex coloring of graphs Vertex coloring of graphs Randomized algorithms Distributed computing
ISSN:	0020-0190, 1872-6119
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!