15-453 Formal Languages, Automata, and Computation
Lecture 35: The Vertex Cover Problem

We give an example of a NP-complete problem, VERTEX-COVER. The proof proceeds by a polynomial-time reduction from a problem already known to be NP-complete (3SAT in this case).

• Reading: Ch. 7.5, pp. 260-262
• Previous lecture: The Importance of SAT
• Next lecture: The Hamiltonian Path Problem

[ Home | Schedule | Assignments | Handouts | Overview ]

fp@cs
Frank Pfenning