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]

Authors

Leslie Ann Goldberg

This author has not been identified. Look up 'Leslie Ann Goldberg' in Google

Steven Kelk

This author has not been identified. Look up 'Steven Kelk' in Google

Mike Paterson

This author has not been identified. Look up 'Mike Paterson' in Google