This preview shows pages 1–3. 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: vertices?A vertex cover is a set of vertices such that for each edge in G, at least 1 vertex in the set is incident upon it. x 1 , x 2 , x n # clauses = l # variables = m For each clause, build a triangle: x1 = T x2 = F All triangles and bars are covered. Now show that the extra edges are covered:...
View
Full
Document
This note was uploaded on 09/16/2011 for the course COT 4210 taught by Professor Staff during the Spring '08 term at University of Central Florida.
 Spring '08
 Staff

Click to edit the document details