Vertex cover
maths
graph-theory
Vertex cover
Given an undirected graph $G = (V,E)$ a set $C \subset V$ is a vertex cover if for all $(u,v) \in E$ we have $u \in C$ or $v \in C$.
Given an undirected graph $G = (V,E)$ a set $C \subset V$ is a vertex cover if for all $(u,v) \in E$ we have $u \in C$ or $v \in C$.