Corrigendum: the complexity of counting graph homomorphisms

Authors:
Martin Dyer;Catherine Greenhill
Affiliations:
School of Computing, University of Leeds, Leeds, United Kingdom LS2 9JT;School of Mathematics, The University of New South Wales, Sydney NSW 2052, Australia
Venue:
Random Structures & Algorithms
Year:
2004

Citing 1
Cited 6

The complexity of counting graph homomorphisms

Proceedings of the ninth international conference on on Random structures and algorithms

Path coupling using stopping times and counting independent sets and colorings in hypergraphs

Random Structures & Algorithms
Holant problems and counting CSP

Proceedings of the forty-first annual ACM symposium on Theory of computing
A worst-case time upper bound for counting the number of independent sets

CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
On the complexity of #CSP

Proceedings of the forty-second ACM symposium on Theory of computing
Computational Complexity of Holant Problems

SIAM Journal on Computing
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We close a gap in the proof of Theorem 4.1 in our paper "The complexity of counting graph homomorphisms" [Random Structures Algorithms 17 (2000), 260-289].