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.

Podrobná bibliografia

Vydané v:	Information processing letters Ročník 70; číslo 5; s. 229 - 232
Hlavný autor:	Johansson, Ojvind
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 21.06.1999 Elsevier Sequoia S.A
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!