CS6363: Computer Algorithms
Spring 2008
Assignment 9

Due: Monday, April 28 (in class)


1. Ex. 34.1-1 (page 978).  Longest path.

2. Ex. 34.5-1 (page 1017).  Subgraph isomorphism.

3. Prove that the Longest-Path problem defined in Q1 is NP-complete,
   by providing a reduction from the Hamiltonian path problem.

4. Ex. 34.5-2 (page 1017).  0-1 IP.


Extra credit 1: Prove that the Longest-Path problem defined in Q1 is
NP-complete, by providing a reduction from the Hamiltonian cycle problem.

Extra credit 2: Problem 34-3 (page 1019).  Graph coloring.

Extra credit 3: Ex. 34.2-7 (page 983).  Hamiltonian path in a DAG.