Machine-translated by Google. Questions are authored in English.
Top

Discussion

What is a binary constraint network?

  • A.A network in which every variable has exactly two neighbours
  • B.A representation storing each constraint as two directed arcs
  • C.A problem in which every constraint relates exactly two variables
  • D.A problem whose variables all have two valued domains

Answer: C

A binary network has only pairwise constraints, so the constraint graph captures the problem completely and every result about graph structure applies directly. Boolean domains, degree two graphs and arc representations are different notions, though the last is how such networks are usually stored. Restricting to the binary case is what makes the connection between graph structure and algorithmic difficulty exact rather than approximate.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.