Coloring k-colorable graphs in constant expected parallel time

Kučera, Luděk

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Report

Coloring k-colorable graphs in constant expected parallel time

MPS-Authors

/persons/resource/persons215941

Kučera, Luděk
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

MPI-I-93-110.pdf
(Any fulltext), 11MB

Supplementary Material (public)

There is no public supplementary material available

Citation

Kučera, L.(1993). Coloring k-colorable graphs in constant expected parallel time (MPI-I-93-110). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-B745-1

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.