The main work of this dissertation is on those CSPs which belong to NP-Complete problems, such as Satisfiability ( SAT), K-Coloring and Hamilton Circle problems. 本文工作的重点是针对那些属于NP-Complete的CSP问题(如SAT、K-着色和Hamilton圈问题等)。
The former is attacked by 2-coloring the conflict graph and the latter is attacked by K-coloring the interference graph. 前者通过对冲突图2-着色解决,后者通过对干涉图K-着色解决。