CSCE 421/821, Spring 2019, Glossary 7

Assigned: Monday, Feb 25
Due: Monday, Mar 4
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.

Not all the terms below were discussed in class. Please refer to your textbook and reading material.

    Search

  1. Binary or 2-way branching (in a search tree)
  2. k-way branching (in a search tree)
  3. Generalized Arc Consistency

    4. GAC Algorithm for AllDiff
  4. Definition of a Bipartite Graph
  5. A maximal matching in a bipartite graph
  6. A free edge in a matching in a bipartite graph
  7. A free vertex in a matching in a bipartite graph
  8. A vital edge in a bipartite graph
  9. Strongly connected component in a directed graph
  10. Value graph of an all-diff contraint

Do not forget to list your references.
Berthe Y. Choueiry