On generating all maximal independent sets
Information Processing Letters
On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Discrete Mathematics - Algebraic graph theory; a volume dedicated to Gert Sabidussi
Journal of the ACM (JACM)
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
The Approximability of Three-valued MAX CSP
SIAM Journal on Computing
The complexity of partition functions
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights
Journal of Computer and System Sciences
On counting homomorphisms to directed acyclic graphs
Journal of the ACM (JACM)
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The Complexity of the Counting Constraint Satisfaction Problem
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Size Bounds and Query Plans for Relational Joins
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
The complexity of temporal constraint satisfaction problems
Journal of the ACM (JACM)
Enumerating all solutions for constraint satisfaction problems
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
Structural tractability of enumerating CSP solutions
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Towards Sharp Inapproximability for Any 2-CSP
SIAM Journal on Computing
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Structural tractability of counting of solutions to conjunctive queries
Proceedings of the 16th International Conference on Database Theory
Hi-index | 0.03 |
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 similar point of view. It turns out that the enumeration problem behaves very differently from the decision version. We give evidence that it is unlikely that a characterization result similar to the decision version can be obtained. Nevertheless, we show nontrivial cases where enumeration can be done with polynomial delay.