This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 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. (a, b) a d G = b c VC = {a, c}, or {b, c} (a, c) z 1 (b, c) z 2 (c, d)...
View Full
Document
 Fall '10
 Dutton

Click to edit the document details