A vertex cover of a graph is a set of vertices such that each edge in the graph is incident to at least one vertex in the set. Finding the smallest possible vertex cover is an NP-hard problem, which means there is no known polynomial-time algorithm to solve it for all graphs.