Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > COUPLING FROM THE PAST:
Reports tagged with Coupling from the Past:
TR19-164 | 6th November 2019
Siddharth Bhandari, Sayantan Chakraborty

Improved bounds for perfect sampling of $k$-colorings in graphs

Revisions: 1

We present a randomized algorithm that takes as input an undirected $n$-vertex graph $G$ with maximum degree $\Delta$ and an integer $k > 3\Delta$, and returns a random proper $k$-coloring of $G$. The
distribution of the coloring is perfectly uniform over the set of all proper $k$-colorings; ... more >>>




ISSN 1433-8092 | Imprint