On Markov Chains for Randomly H-Coloring a Graph
From MaRDI portal
Publication:2731604
DOI10.1006/jagm.2000.1142zbMath0974.68149OpenAlexW1974691089WikidataQ56324021 ScholiaQ56324021MaRDI QIDQ2731604
Colin Cooper, Martin Dyer, Alan M. Frieze
Publication date: 29 July 2001
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2000.1142
Related Items
Counting and sampling \(H\)-colourings, Algorithms to approximately count and sample conforming colorings of graphs, The Complexity of Approximately Counting Tree Homomorphisms, Systematic scan for sampling colorings, On systematic scan for sampling H-colorings of the path, A NEW APPROACH TO THE VERTEX COLORING PROBLEM, Approximate Counting via Correlation Decay in Spin Systems, Counting \(H-\)colorings of partial \(k-\)trees