##
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.
- Bandwidth of a graph
- Complete graph
- Clique
- Degree ordering heuristic
- Directed acyclic graph
- Efficient algorithm
- Fail-first principle
- Induced width of an ordering (check your textbook)
- $k$-tree
- Least-domain heuristic
- Maintaining arc-consistency (MAC)
- Mathematical Programming
- Maximal cliques in a graph
- Maximum cardinality heuristic
- Maximum clique in a graph
- Min-conflict heuristic
- Tractable problem
- Triangulated graph (a.k.a. chordal graph)
- Weighted-degree ordering heuristic (may want to check original paper)
- Width of an ordering
- Width of a graph
- (The difference between) a set and a bag

Do not forget to list your references.

Berthe Y. Choueiry