CS 161  Algorithms Homework 7, 25 Points
Due: Monday, March 10, 2014
 Problem C8.1 from GoodrichTamassia.
 Problem R13.3 from GoodrichTamassia.

Define
SUBGRAPHISOMORPHISM as the problem that takes a graph, G, and
another graph, H, and determines if H
is isomoprhic to a subgraph of G.
That is, the problem is to determine whether there is a onetoone mapping,
f, of the vertices in H to a subset of the vertices
in G such that, if (v,w) is an edge in
H, then ( f(v), f(w)) is an edge
in G. Show that
SUBGRAPHISOMORPHISM is NPcomplete.
 Problem C13.8 from GoodrichTamassia.
 Problem C13.12 from GoodrichTamassia.