CSCE 896-004, Fall 2009, Glossary 8

Assigned: Friday, Nov 13, 2009.
Due: Tuesday, Nov 17, 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.

Search your textbook, notes, the web, or the library to define/describe the following. It is very important to list all your references.

  1. Binary or 2-way branching (in a search tree)
  2. Bipartite Graph
    1. Definition of a Bipartite Graph
    2. A maximal matching in a bipartite graph
    3. A free edge in a matching in a bipartite graph
    4. A free vertex in a matching in a bipartite graph
    5. A vital edge in a bipartite graph
  3. Generalized Arc Consistency
  4. k-way branching (in a search tree)
  5. Simple path in a graph
  6. Strongly connected component in a directed graph
  7. Value graph of an all-diff contraint

Berthe Y. Choueiry