This preview shows page 1. Sign up to view the full content.
Unformatted text preview: (2) Create a cycle with all the "a" vertices by adding an edge between the last of one component to the first a of the next component (the order of components is unimportant). Repeat for every vertex in G. (3) Add an additional k vertices z 1 , z 2 , , z k . Add edges from each of these to every input/output vertex. This is the graph H and is an instance of Hamiltonian Cycle....
View Full Document
- Fall '10