The complexity of choosing an H-colouring (nearly) uniformly at random
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Counting H-colorings of partial k-trees
Theoretical Computer Science
Counting H-Colorings of Partial k-Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Counting and Sampling H-Colourings
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Counting and sampling H-colourings
Information and Computation
A cellular learning automata-based algorithm for solving the vertex coloring problem
Expert Systems with Applications: An International Journal
Approximate counting via correlation decay in spin systems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for graph homomorphism problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
| Hi-index | 0.00 |