Indexed metadata
Improved bounds for sampling colorings
Eric Vigoda
Source abstract
We consider the problem of sampling uniformly at random from the set of proper k-colorings of a graph with maximum degree Δ. Our main result is the design of a simple Markov chain that converges in O(nk log n) time to the desired distribution when k>116Δ.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.