Minimum vertex cover problem
programming
graph-theory
Statement
Minimum vertex cover problem
Given an undirected graph $G = (V,E)$ provide a vertex cover of smallest size.
Given an undirected graph $G = (V,E)$ provide a vertex cover of smallest size.