On counting homomorphisms to directed acyclic graphs

Journal of the ACM

Volumn 54, Issue 6, 2007, Pages

  Dyer, Martin ^a   Goldberg, Leslie Ann ^b   Paterson, Mike ^c,d  

^a UNIVERSITY OF LEEDS   (United Kingdom)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c UNIVERSITY OF WARWICK   (United Kingdom)

^d UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Counting; Directed acyclic graphs; Homomorphisms

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PROBLEM SOLVING; THEOREM PROVING;

CONSTRAINT SATISFACTION PROBLEMS; DIRECTED ACYCLIC GRAPHS; HOMOMORPHISMS;

GRAPH THEORY;

EID: 37049036319     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1314690.1314691     Document Type: Article

References (14)

1. BULATOV, A., AND DALMAU, V. 2003. Towards a dichotomy theorem for the counting constraint satisfaction problem. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 562-571.
2. BULATOV, A., AND GROHE, M. 2005. The complexity of partition functions. Theoret. Comput. Sci. 348, 2, 148-186.
3. CREIGNOU, N., AND HERMANN, M. 1996. Complexity of generalized satisfiability counting problems. Inf. Comput. 125, 1, 1-12.
4. DYER, M., AND GREENHILL, C. 2000. The complexity of counting graph homomorphisms. Random Struct. Algorithms 17, 3-4, 260-289.
5. EVEN, S., AND LITMAN, A. 1997. Layered cross product - A technique to construct interconnection networks. Networks 29, 4, 219-223.
6. FEDER, T., AND VARDI, M. 1998. The computational structure of monotone monadic snp and constraint satisfaction: A study through datalog and group theory. SIAM J. Comput. 28, 1, 57-104.
7. HELL, P., AND NEŠETŘIL, J. 1990. On the complexity of h-coloring. J. Combinat. Theory Ser. B 48, 1, 92-110.
8. HELL, P., AND NEŠETŘIL, J. 2004. Graphs and Homomorphisms. Oxford University Press, Oxford, UK.
9. IMRICH, W., AND KLAVŽAR, S. 2000. Product Graphs: Structure and Recognition. Wiley, New York.
10. LADNER, R. 1975. On the structure of polynomial time reducibility. J. ACM 22, 1, 155-171.
11. LOVÁSZ, L. 1967. Operations with structures. Acta Math. Acad. Sci. Hungary 18, 321-328.
12. SCHAEFER, T. 1978. The complexity of satisfiability problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing. ACM, New York, 216-226.
13. VALIANT, L. 1979. The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 3, 410-421.
14. VAN LINT, J., AND WILSON, R. 2001. A Course in Combinatorics, 2nd ed. Cambridge University Press, Cambridge, UK.