# IEOR 6614, Spring 2006 : Homework 01

Assigned: Thursday, January 19,2006
Due: Wednesday, September 25, 2006

## General Instructions

1. Please review the course information.
2. 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.
3. Numbered problems are all from the textbook Network Flows .

## Problems

2. Have you had a course in data structures and/or algorithms? If so, briefly describe the course.
3. Have you had a course in linear programming? If so, briefly describe the course.
4. Have you had a courses combinatorics, graph theory, and/or discrete mathematics? If so, briefly describe the course.
5. Describe your computer programming experience.
1. Problem 2.10. Connectivity in graphs.
2. Problem 3.4. Function ranking.
3. Problem 3.6. Big-O and Big-Omega
4. Given a directed graph G=(V,E), with vertex set V and edge set E, we define the transpose graph, GT=(V,ET), to be G with all its edges reversed. That is, if G has an edge (v,w) then GT will have an edge (w,v).
1. Give an algorithm for computing GT from G, when G is given by an adjacency matrix.
2. Give an algorithm for computing GT from G, when G is given by an adjacency list
5. The node-arc incidence matrix N is defined on page 32 of the textbook. Explain what the matrix product N NT represents.

### Switch to:

cliff@ieor.columbia.edu