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.

Bibliographic Details

Published in:	Information processing letters Vol. 70; no. 5; pp. 229 - 232
Main Author:	Johansson, Ojvind
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 21.06.1999 Elsevier Sequoia S.A
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!