CSOR 4231 05F: Homework 6

Required for Undergraduates: 6 of the following 9 problems
Required for Graduate Students: 7 of the following 9 problems
Points: 10 pts per problem

General Instructions

1. Please review the homework and grading policy outlined in the course information page.

2. On the first page of your solution write-up, you must make explicit which problems are to be graded for "regular credit", which problems are to be graded for "extra credit", and which problems you did not attempt. Please use a table something like the following

   Problem	01	02	03	04	05	06	07	08	09	...
   Credit	RC	RC	RC	EC	RC	RC	NA	RC	RC	...

   where "RC" is "regular credit", "EC" is "extra credit", and "NA" is "not attempted" (not applicable). Failure to do so will result in an arbitrary set of problems being graded for regular credit, no problems being graded for extra credit, and a five percent penalty assessment.

3. You must also write down with whom you worked on the assignment. If this changes from problem to problem, then you should write down this information separately with each problem.
4. Start early, be concise but rigorous, and enjoy!

Specific Instructions

1. Unless otherwise specified, all problems and exercises are from CLRS, Introduction to Algorithms, 2nd edition.

Problems

1. Exercise 22.3-7, 22.3-8. Depth-first search.
2. Exercise 22.5-3. Strongly connected components.
3. Problem 22-2. Articulation point, breidges and biconnected components.
4. Exercise 23.1-5. Heavy edges in minimum spanning trees.
5. Problem 23-1. Second best minimum spanning tree.
6. Exercise 24.1-3. Bellman-Ford
7. Exercise 24.3-5. Breadth-first search and shortest paths.
8. Problem 24-4. Scaling for shortest paths.
9. Problem 24-5. Minimum mean cycle.

Switch to:

• CSOR 4231 05F Home Page
• Homework 5
• Homework 7