Lec20PolyR2 - vertices?-A vertex cover is a set of vertices...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Paul Bates Class Notes 4-18-05 3 SAT reduced to Vertex-Cover - Assuming there’s a polynomial solution to Vertex-cover, we will solve 3-SAT in polynomial time. Given an input w to 3-SAT, we will construct a function (in polynomial time), f such that f(w) is an element of Vertex-Cover iff w is an element of 3-SAT. Vertex-Cover - Given a graph G and an integer k, does there exist a vertex cover of G using k
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
Background image of page 3
This is the end of the preview. Sign up to access the rest of the 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.

Page1 / 3

Lec20PolyR2 - vertices?-A vertex cover is a set of vertices...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online