CSCE 421/821, Fall 2014, Glossary 5

Assigned: Friday, Oct 17
Due: Friday, Oct 24
Note: Glossaries are optional but they allow you improve your grade. Also, you are responsible for knowing the exact definition of the terms in a glossary at any point in time, including during a quiz. You may need to check the following documents:
  1. Bandwidth of a graph
  2. Complete graph
  3. Constraint density of a binary CSP
  4. Constraint tightness of a binary constraint
  5. Clique
  6. Degree ordering heuristic
  7. Directed acyclic graph
  8. Efficient algorithm
  9. Fail-first principle
  10. Induced width of an ordering (check your textbook)
  11. Least-domain heuristic
  12. Mathematical Programming
  13. Maintaining arc-consistency (MAC)
  14. Maximal cliques in a graph
  15. Maximum cardinality heuristic
  16. Min-conflict heuristic
  17. Phase transition
    1. Critical value of order parameter
    2. Order parameter
    3. Phase transition
  18. Tractable problem
  19. Triangulated graph (a.k.a. chordal graph)
  20. Weighted-degree ordering heuristic (may want to check original paper)
  21. Width of an ordering
  22. Width of a graph
Do not forget to list your references.
Berthe Y. Choueiry