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

Siddharth Bhandari Sayantan Chakraborty

Published in: Electron. Colloquium Comput. Complex. (2019)

Keyphrases

upper bound
lower bound
uniform random
data sets
monte carlo
graph matching
graph structure
training set
simulated annealing
graphical models
directed graph
error bounds
improved algorithm
spanning tree
graph representation