The graph with one vertex per variable and an edge between distinct variables occurring in a common constraint scope. Each hypergraph edge of the constraint hypergraph becomes a clique. A constraint satisfaction problem consisting only of all-different constraints on a common constraint domain is exactly a proper graph colouring problem on this primal graph.

Ancestors (8)

  1. Constraint hypergraph
  2. Constraint satisfaction problem
  3. Search problem
  4. Computational problem
  5. Computational complexity theory
  6. Theoretical computer science
  7. Computer science
  8. Home

Incoming links (5)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version