Highly Influenced

5 Excerpts

@article{Bulatov2004AGO, title={A graph of a relational structure and constraint satisfaction problems}, author={Andrei A. Bulatov}, journal={Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.}, year={2004}, pages={448-457} }

- Published in Proceedings of the 19th Annual IEEE Symposium on…2004
DOI:10.1109/LICS.2004.1319639

In the constraint satisfaction problem CSP(H) corresponding to a finite relational structure H, the aim is to decide, given a relational structure G, whether there exists a homomorphism from G to H. In (Bulatov, 2003), we proved that if H is a conservative structure, then it can be associated with a complete edge-3-colored graph whose vertex set is the universe of H. The complexity and a solution algorithm for CSP(H) strongly depend on certain properties of the associated graph. In this paper… CONTINUE READING