Improved bounds for perfect sampling of k-colorings in graphs

DOI10.1145/3357713.3384244OpenAlexW3034989894MaRDI QIDQ5144950

Siddharth Bhandari, Sayantan Chakraborty

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.10323

zbMATH Keywords

graph coloringsperfect sampling

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

Perfect sampling from spatial mixing ⋮ Block symmetries in graph coloring reconfiguration systems ⋮ Exact distributed sampling ⋮ Improved Bounds for Perfect Sampling of $k$-Colorings in Graphs

This page was built for publication: Improved bounds for perfect sampling of k-colorings in graphs