Homework 13, Fundamental Algorithms, Fall 97

Due Date: Monday, December 8.

Problems 4.20, 4.21, 6.2, 6.4. (See back of text, page 406-411).

Comment: The reduced graph H of a directed graph G is defined as follows. For each strong component C of G there is a vertex c in H; there is a directed edge (c,d) in H exactly if there is a directed edge (v,w) in G, with v in strong component C and w in strong component D.

Course Home Page

cole@cs.nyu.edu (Richard Cole)
Last modified: Nov 25, 1997