The complexity of choosing an H-colouring (nearly) uniformly at random

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 53-62

  Goldberg, Leslie Ann ^a   Kelk, Steven ^a   Paterson, Mike ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CALCULATIONS; GRAPH THEORY; POLYNOMIALS; RANDOM PROCESSES; SAMPLING; THEOREM PROVING;

FULLY-POLYNOMIAL RANDOMISED APPROXIMATION SCHEME; H-COLOURING; POLYNOMIAL ALMOST UNIFORM SAMPLER;

COMPUTATIONAL COMPLEXITY;

EID: 0036040194     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.509917     Document Type: Conference Paper

References (17)

1. On the sampling problem for H-colorings on the hypercubic lattice
2. Graph homomorphisms and phase transitions
3. On Markov chains for randomly H-colouring a graph
4. (H, C, K)-coloring: Fast, easy, and hard cases
5. The complexity of parameterized H-colorings: A survey
6. On counting independent sets in sparse graphs
7. Random walks on combinatorial objects
8. On markov chains for independent sets
9. The complexity of counting graph homomorphisms
10. On the relative complexity of approximate counting problems
11. Rapidly mixing markov chains for dismantleable constraint graphs
12. The complexity of H-coloring of bounded degree graphs
13. On the complexity of H-coloring
14. A very simple algorithm for estimating the number of k-colorings of a low-degree graph
15. Sampling and counting
16. Random generation of combinatorial structures from a uniform distribution
17. Improved bounds for sampling colorings