A graph of a relational structure and constraint satisfaction problems

@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}
}
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

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 42 CITATIONS

Bounded relational width

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Bounded width problems and algebras

VIEW 6 EXCERPTS
CITES RESULTS & BACKGROUND
HIGHLY INFLUENCED

Graphs of relational structures: restricted types

  • 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2016
VIEW 8 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

A new line of attack on the dichotomy conjecture

VIEW 17 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Non-dichotomies in Constraint Satisfaction Complexity

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

A Dichotomy Theorem for Nonuniform CSPs

  • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
VIEW 2 EXCERPTS
CITES BACKGROUND

Constraint satisfaction problems over semilattice block Mal'tsev algebras

  • 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2017

References

Publications referenced by this paper.
SHOWING 1-10 OF 35 REFERENCES

The complexity of maximal constraint languages

A. Bulatov, P. Jeavons, A. Krokhin
  • In Proceedings of the 33rd Annual ACM Simposium on Theory of Computing,
  • 2001
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

On the Algebraic Structure of Combinatorial Problems

  • Theor. Comput. Sci.
  • 1998
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Closure properties of constraints

VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

On the complexity of �coloring

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

Similar Papers

Loading similar papers…