Improved Bounds for Perfect Sampling of $k$-Colorings in Graphs.

Siddharth Bhandari Sayantan Chakraborty

Published in: SIAM J. Comput. (2022)

Keyphrases

lower bound
sample size
monte carlo
graph matching
upper bound
error bounds
sampling methods
neural network
scheduling problem
phase transition
graph structure
graph partitioning
lower and upper bounds
upper and lower bounds
sampling algorithm
graph coloring