CSCE 421/821, Fall 2014, Glossary 7

Assigned: Friday, Nov 21
Due: Monday, Dec 1
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 other references.


  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

  5. Definition of a Bipartite Graph
  6. A maximal matching in a bipartite graph
  7. A free edge in a matching in a bipartite graph
  8. A free vertex in a matching in a bipartite graph
  9. A vital edge in a bipartite graph
  10. Strongly connected component in a directed graph
  11. Value graph of an all-diff contraint
  12. Local Search

  13. Breakout method (in local search)
  14. Crossover point
  15. ERA
  16. Genetic algorithms
  17. Greedy local search
  18. Hill climbing
  19. Fitness function
  20. Local optimum
  21. Plateau
  22. Random mutation
  23. Random walk
  24. Restart strategy
  25. Simulated annealing
  26. Tabu search
Do not forget to list your references.
Berthe Y. Choueiry