The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random

Leslie Ann Goldberg, Steven Kelk, Mike Paterson. The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random. SIAM Journal on Computing, 33(2):416-432, 2004. [doi]

Abstract

Abstract is missing.