A graph of a relational structure and constraint satisfaction problems

  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.},
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

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


Publications referenced by this paper.

The complexity of maximal constraint languages

  • A. Bulatov, P. Jeavons, A. Krokhin
  • In Proceedings of the 33rd Annual ACM Simposium…
  • 2001
Highly Influential
6 Excerpts

On the complexity of �coloring

  • J. Nešetřil
  • IEEE Computer Society
  • 2003

Similar Papers

Loading similar papers…