Category
page 1Covering problems
art gallery problem
mathematical problem
vertex cover
a set of vertices that includes at least one endpoint of every edge in a graph
set cover problem
classical problem in combinatorics
edge cover
a set of edges that touches every vertex of a graph
bipartite dimension
intrinsic property of undirected graphs