TY - JOUR
T1 - Random hypergraph coloring algorithms and the weak chromatic number
AU - Schmidt‐Pruzan, Jeanette
AU - Shamir, Eli
AU - Upfal, Eli
PY - 1985
Y1 - 1985
N2 - We present a hypergraph coloring algorithm and analyze its performance in spaces of random hypergrpahs. In these spaces the number of colors used by our algorithm is almost surely within a small constant factor (less than 2) of the weak chromatic number of the hypergraph. This also establishes new upper and lower bounds for the weak chromatic number of uniform hypergraphs.
AB - We present a hypergraph coloring algorithm and analyze its performance in spaces of random hypergrpahs. In these spaces the number of colors used by our algorithm is almost surely within a small constant factor (less than 2) of the weak chromatic number of the hypergraph. This also establishes new upper and lower bounds for the weak chromatic number of uniform hypergraphs.
UR - http://www.scopus.com/inward/record.url?scp=84986531905&partnerID=8YFLogxK
U2 - 10.1002/jgt.3190090307
DO - 10.1002/jgt.3190090307
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84986531905
SN - 0364-9024
VL - 9
SP - 347
EP - 362
JO - Journal of Graph Theory
JF - Journal of Graph Theory
IS - 3
ER -