Constraint satisfaction dual problem

（重定向自Join graph）

The dual problem is a reformulation of a constraint satisfaction problem expressing each constraint of the original problem as a variable. Dual problems only contain binary constraints, and are therefore solvable by algorithms tailored for such problems. The join graphs and join trees of a constraint satisfaction problem are graphs representing its dual problem or a problem obtained from the dual problem removing some redundant constraints.

单词	Join graph
释义	Join graph 英语百科 Constraint satisfaction dual problem （重定向自Join graph） The dual problem is a reformulation of a constraint satisfaction problem expressing each constraint of the original problem as a variable. Dual problems only contain binary constraints, and are therefore solvable by algorithms tailored for such problems. The join graphs and join trees of a constraint satisfaction problem are graphs representing its dual problem or a problem obtained from the dual problem removing some redundant constraints.
随便看	night singer night sisht night skirt NightSky Night sky night sky background nightsky glow night sky light night sky luminescence night sky radiation night sky spectrograph night sky spectrum night sleep deprivation night snack Night snake night snakes night soil Nightsoil nightsoil collection nightsoil collector night soil collector nightsoil control nightsoil fever night soil management nightsoils