Assigned:
Thursday, January 19,2006
Due:
Wednesday, September 25, 2006
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.10. Connectivity in graphs.
 Problem 3.4. Function ranking.
 Problem 3.6. BigO and BigOmega
 Given a directed graph G=(V,E), with vertex set V and edge set E,
we define the transpose graph, G^{T}=(V,E^{T}), to
be G with all its edges reversed. That is, if G has an edge (v,w)
then G^{T} will have an edge (w,v).
 Give an algorithm for computing G^{T} from G, when G
is given by an adjacency matrix.
 Give an algorithm for computing G^{T} from G, when G
is given by an adjacency list
 The nodearc incidence matrix N is defined on page 32 of the
textbook. Explain what the matrix product N
N^{T} represents.
Switch to:
cliff@ieor.columbia.edu