199:
158:
is the graph in which the vertices are all constraint scopes involved in the constraints of the problem, and two vertices are connected by an edge if the corresponding scopes have common variables.
111:. The hypergraph is recovered by defining the vertices as the variable-vertices and the hyperedges as the sets of variable-vertices connected to each constraint-vertex.
103:
there is an edge between a variable-vertex and a constraint-vertex if and only if the corresponding variable occurs in the corresponding constraint.
222:
90:
correspond to the constraints. A set of vertices forms a hyperedge if the corresponding variables are those occurring in some constraint.
135:
whose nodes are the variables of the problem and an edge joins a pair of variables if the two variables occur together in a constraint.
195:
217:
59:
132:
28:
139:
93:
A simple way to represent the constraint hypergraph is by using a classical graph with the following properties:
32:
43:
39:
47:
191:
183:
108:
211:
17:
67:
63:
187:
87:
83:
100:
an edge can only connect a variable-vertex to a constraint-vertex, and
150:
The set of variables involved in a constraint is called the
86:
in which the vertices correspond to the variables, and the
97:
Vertices correspond either to variables or to constraints,
58:
are used to represent relations among constraints in a
70:, which allows for the existence of free variables.
131:) of a constraint satisfaction problem is the
8:
138:The primal constraint graph is in fact the
175:
173:
171:
82:of a constraint satisfaction problem is a
167:
7:
180:Handbook of Constraint Programming
25:
142:of the constraint hypergraph.
60:constraint satisfaction problem
1:
107:Properties 1 and 2 define a
29:electronic design automation
223:Application-specific graphs
239:
62:. A constraint graph is a
26:
33:Constraint graph (layout)
121:primal constraint graph
115:Primal constraint graph
44:artificial intelligence
40:constraint satisfaction
218:Constraint programming
156:dual constraint graph
146:Dual constraint graph
80:constraint hypergraph
74:Constraint hypergraph
18:Dual constraint graph
48:operations research
186:, Peter Van Beek,
52:constraint graphs
16:(Redirected from
230:
202:
177:
152:constraint scope
21:
238:
237:
233:
232:
231:
229:
228:
227:
208:
207:
206:
205:
184:Francesca Rossi
178:
169:
164:
148:
117:
109:bipartite graph
76:
36:
27:For a graph in
23:
22:
15:
12:
11:
5:
236:
234:
226:
225:
220:
210:
209:
204:
203:
166:
165:
163:
160:
147:
144:
116:
113:
105:
104:
101:
98:
75:
72:
24:
14:
13:
10:
9:
6:
4:
3:
2:
235:
224:
221:
219:
216:
215:
213:
201:
197:
196:0-444-52726-5
193:
189:
185:
181:
176:
174:
172:
168:
161:
159:
157:
153:
145:
143:
141:
136:
134:
130:
129:Gaifman graph
126:
122:
114:
112:
110:
102:
99:
96:
95:
94:
91:
89:
85:
81:
73:
71:
69:
65:
61:
57:
53:
49:
45:
41:
34:
30:
19:
179:
155:
151:
149:
140:primal graph
137:
128:
125:primal graph
124:
120:
118:
106:
92:
79:
77:
68:factor graph
64:special case
55:
51:
42:research in
37:
200:p. 211, 212
56:hypergraphs
212:Categories
188:Toby Walsh
162:References
127:(also the
123:or simply
88:hyperedges
84:hypergraph
190:(2006)
154:. The
194:
31:, see
182:, by
133:graph
66:of a
192:ISBN
119:The
78:The
54:and
46:and
38:In
214::
198:,
170:^
50:,
35:.
20:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.