##
CSCE 421/821, Spring 2011, Glossary 5

**Assigned: Monday, Feb 14, 2011.**

**Due: Monday, Feb 21, 2011.**

**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.
- Complete graph
- Clique
- Directed acyclic graph
- Efficient algorithm
- $k$-tree
- Mathematical Programming
- Maximal cliques in a graph
- Maximum clique in a graph
- Tractable problem
- Triangulated graph (a.k.a. chordal graph)

Do not forget to list your references.

Berthe Y. Choueiry