Assigned:
Thursday, January 20, 2011
Due:
Thursday, January 27, 2011
General Instructions
 Please review the
course information.
 You must 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.
 Numbered problems are all from the textbook Network Flows .
Problems

 List your previous degrees.
 Have you had a course in data structures and/or algorithms?
If so, briefly describe the course.
 Have you had a course in linear programming? If so, briefly
describe the course.
 Have you had a courses combinatorics, graph theory, and/or
discrete mathematics? If so, briefly describe the course.
 Describe your computer programming experience.
 Problem 2.38. Adjacency matrices and strong connectivity.
 Problem 3.4. Function ranking.
 Problem 3.24. Graph search.
 Problem 3.38. Directed cycles.
 Problem 13.14. Tree minimax result.
 Prove that in a graph in which all edge weights are distinct, the minimum
spanning tree is unique.
Switch to:
cliff@ieor.columbia.edu