15453 Formal Languages, Automata, and Computation
Lecture 35: The Vertex Cover Problem
We give an example of a NPcomplete problem, VERTEXCOVER. The
proof proceeds by a polynomialtime reduction from a problem already
known to be NPcomplete (3SAT in this case).
[ Home
 Schedule
 Assignments
 Handouts
 Overview
]
fp@cs
Frank Pfenning
