max planck institut
informatik

# MPI-I-93-110

## Coloring k-colorable graphs in expected parallel time

### Kucera, Ludek

MPI-I-93-110. February 1993, 14 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
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.
Acknowledgement:
References to related material:

MPI-I-93-110.pdf11176 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1993-110
BibTeX
@TECHREPORT{Kucera93b,
AUTHOR = {Kucera, Ludek},
TITLE = {Coloring k-colorable graphs in expected parallel time},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},