The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Enumerating Homomorphisms
[article]
2009
arXiv
pre-print
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision version of the homomorphism problem received a lot of attention in literature; in particular, the way the graph-theoretical structure of the variables and constraints influences the complexity of the problem is intensively studied. Here we study the problem of enumerating all the solutions with polynomial delay from a
arXiv:0902.1256v1
fatcat:tu25yj6rnzgtnowgkdei3gqrsi