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