CSCE 421/821, Spring 2009, Glossary 5

Assigned: Monday, Feb 16, 2009.
Due: Monday, Feb 23, 2009.
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. Complete graph
  2. Clique
  3. Directed acyclic graph
  4. Efficient algorithm
  5. $k$-tree
  6. Mathematical Programming
  7. Maximal cliques in a graph
  8. Maximum clique in a graph
  9. Tractable problem
  10. Triangulated graph (a.k.a. chordal graph)
Do not forget to list your references.
Berthe Y. Choueiry