Complexity of counting graph homomorphisms

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2000, Pages 246-255

  Dyer, Martin ^a   Greenhill, Catherine ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; STATISTICAL METHODS; THEOREM PROVING;

GRAPH HOMOMORPHISMS;

GRAPH THEORY;

EID: 0033896025     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)