TY - JOUR
T1 - Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces
AU - Shamir, Eli
AU - Upfal, Eli
PY - 1984/12
Y1 - 1984/12
N2 - A sequential graph coloring algorithm S and a strict distributed (broadcasting type) algorithm D, and an analysis of their performance in scales of random graph spaces is presented. For a space of graphs with n vertices and a mean degree d(n), the number of colors produced is almost surely bounded by about d(n) logd(n), which is almost surely not more than twice the chromatic number, and the distributed algorithm terminates in O(Max(d(n),logn)) steps.
AB - A sequential graph coloring algorithm S and a strict distributed (broadcasting type) algorithm D, and an analysis of their performance in scales of random graph spaces is presented. For a space of graphs with n vertices and a mean degree d(n), the number of colors produced is almost surely bounded by about d(n) logd(n), which is almost surely not more than twice the chromatic number, and the distributed algorithm terminates in O(Max(d(n),logn)) steps.
UR - http://www.scopus.com/inward/record.url?scp=0002730924&partnerID=8YFLogxK
U2 - 10.1016/0196-6774(84)90003-8
DO - 10.1016/0196-6774(84)90003-8
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0002730924
SN - 0196-6774
VL - 5
SP - 488
EP - 501
JO - Journal of Algorithms
JF - Journal of Algorithms
IS - 4
ER -