CMSC 420 -- Project 2

Project 2

  1. Find a NP-Complete graph theory problem and have it approved by Dymacek.
  2. Find an article which proves your problem is NP-Complete.
  3. Find an article which uses your problem to prove another problem is NP-Complete.
  4. Find an application which uses your problem.
  5. Create a 10 minute presentation which teaches how the problem is NP-Complete and explains why this problem relates to us (application).