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

Siddharth Bhandari Sayantan Chakraborty

Published in: STOC (2020)

Keyphrases

upper and lower bounds
graph matching
graph theory
upper bound
random sampling
lower bound
improved algorithm
directed graph
graph structure
evolutionary algorithm
sample size
bipartite graph
lower and upper bounds
sampled data
graph coloring