Glossary V

Distributed:  Thursday, October 25, 2001.
To be returned: Thursday, November 1, 2001
Note: Glossaries are optional but strongly recommended.
 
  1. bandwidth of a graph
  2. criticality
  3. cruciality
  4. fail first principle
  5. least domain heuristic
  6. min-conflict
  7. promise
  8. partial permutation problem
  9. permutation problem
  10. width of an ordering
  11. width of a graph
Do not forget to list your references.


choueiry@cse.unl.edu