# Minimum vertex cover problem
Last edited: 2023-11-11
# Statement
Minimum vertex cover problem
Given an undirected graph $G = (V,E)$ provide a vertex cover of smallest size.
Last edited: 2023-11-11
Given an undirected graph $G = (V,E)$ provide a vertex cover of smallest size.