MPI-INF/SWS Research Reports 1991-2021
2. Number - only D1
MPI-I-93-110
Coloring k-colorable graphs in expected parallel time
Kucera, Ludek
February 1993, 14 pages.
.Status: available - back from printing
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.
-
MPI-I-93-110.pdf
- Attachement: MPI-I-93-110.pdf (11176 KBytes)
URL to this document: https://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},
ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-93-110},
MONTH = {February},
YEAR = {1993},
ISSN = {0946-011X},
}