Contact information
Name:
c. jayne trent
Phone:
610-330-5267
Email:
trentj@lafayette.edu
Abstract: Vertex cover is a signature NP-hard problem; studying its complexities might yield insights into one of the biggest conundrum in computer science: the P v.s. NP problem. We will take a look at the classes P and NP, and see why the vertex cover is such a difficult problem to solve.