Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Database repairing using updates
ACM Transactions on Database Systems (TODS)
Minimum Cost Homomorphism Dichotomy for Oriented Cycles
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
Minimum cost homomorphisms to oriented cycles with some loops
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
| Hi-index | 0.00 |
We discuss the existence of homomorphisms of arbitrary digraphs to a fixed oriented cycle $C$. Our main result asserts that if the cycle $C$ is unbalanced then a digraph $G$ is homomorphic to $C$ if and only if (1) every oriented path homomorphic to $G$ is also homomorphic to $C$, and (2) the length of every cycle of $G$ is a multiple of the length of $C$. This answers a conjecture from an earlier paper with H. Zhou and generalizes a result proved there. We also show that this characterization does not hold for balanced cycles. We relate these results to work on the complexity of homomorphism problems.