CSCE 421/821, Spring 2023, Glossary 5

You may need to check the following documents:
  1. Clique in a graph, maximal clique in a graph
  2. Complete graph
  3. Constraint density of a binary CSP
  4. Constraint tightness of a binary constraint
  5. Degree of a graph
  6. Degree of a vertex in a graph
  7. Efficient algorithm
  8. Fail-first principle (for variable ordering)
  9. Mathematical Programming
  10. Maintaining arc-consistency (MAC)
  11. Maximal cliques in a graph
  12. Order parameter (in phase transition)
  13. Phase Transition
Do not forget to list your references.
Berthe Y. Choueiry