| Homework 18DetailsThe following problems are from pages 184-189 of ADM
Problem | Notes | Grading
|
---|
5-2 | Note: Your book may have a typo. There should be edge (H,F) and not edge (F,H). Use an algorithm (or a modification of one) from the book. Specify what algorithm you are using and show enough work to demonstrate that you actually followed the algorithm. | Computational Problem Rubric
| 5-15 | Don't forget to give the complexity of your algorithm. The last part of the question is asking you to identify another graph problem that is equivalent to this one. In other words, your answer should be something like "this is equivalent to the Travelling Salesman problem". | Algorithm Rubric
| 5-26 | Part (a) is not too hard. Part (b) may require some more thought. | Algorithm Rubric |
|