IEOR 6614, Spring 2006 : Homework 01

Assigned: Thursday, January 26, 2006
Due: Wednesday, February 1, 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 .


  1. Problem 3.28. Breadth-first and depth-first search.
  2. Problem 3.34. Depth-first search and diameter.
  3. Problem 3.46. Depth-first search.
  4. Suppose that you are given a graph, G=(V,E), represented by an adjacency matrix. A universal sink is a node with indegree n-1 and outdegree 0. Given an O(n) time algorithm to determine whether a graph has a universal sink. (Note that, in general, m>n and your algorithm does not have time to look at every edge.
  5. Problem 3.44. Enumerating paths.

Switch to: