Exact Sampling and Approximate Counting Techniques

  title={Exact Sampling and Approximate Counting Techniques},
  author={Mark Huber},
WC present two algorithms for uniformly sampling from the proper colorings of a graph using k colors. We use exact snmpling from the stationary distribution of a Markov chain with states that are the k-colorings of a graph with maximum degree A, As opposed to approximate sampling algorithms based on rapid mixing, these algorithms have terminntion criteria that allow them to stop on some inputs much more quickly than in the worst case running time bound. For the first algorithm we show that when… CONTINUE READING
Highly Cited
This paper has 51 citations. REVIEW CITATIONS


Publications citing this paper.

52 Citations

Citations per Year
Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…