@techreport{MPI-I-93-110,
TITLE = {Coloring k-colorable graphs in constant expected parallel time},
AUTHOR = {Ku{\v c}era, Lud{\v e}k},
LANGUAGE = {eng},
NUMBER = {MPI-I-93-110},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {1993},
DATE = {1993},
ABSTRACT = {A parallel (CRCW PRAM) algorithm is given to find a $k$-coloring of a graph randomly drawn from the family of $k$-colorable graphs with $n$ vertices, where $k = \log^{O(1)}n$. The average running time of the algorithm is {\em constant}, and the number of processors is equal to $|V|+|E|$, where $|V|$, $|E|$, resp. is the number of vertices, edges, resp. of the input graph.},
TYPE = {Research Report / Max-Planck-Institut für Informatik},
}