CSCE 421/821, Fall 2012, Glossary 5

Assigned: Wed, Oct 31st
Due: Wed, Nov 7.
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.
  1. Bandwidth of a graph
  2. Complete graph
  3. Clique
  4. Degree ordering heuristic
  5. Directed acyclic graph
  6. Efficient algorithm
  7. Fail-first principle
  8. Induced width of an ordering (check your textbook)
  9. $k$-tree
  10. Least-domain heuristic
  11. Maintaining arc-consistency (MAC)
  12. Mathematical Programming
  13. Maximal cliques in a graph
  14. Maximum cardinality heuristic
  15. Maximum clique in a graph
  16. Min-conflict heuristic
  17. Tractable problem
  18. Triangulated graph (a.k.a. chordal graph)
  19. Weighted-degree ordering heuristic (may want to check original paper)
  20. Width of an ordering
  21. Width of a graph
  22. (The difference between) a set and a bag
Do not forget to list your references.
Berthe Y. Choueiry