1 paper
Till Fluschnik, Rolf Niedermeier, Valentin Rohm +1
Covering all edges of a graph by a small number of vertices, this is the NP-complete Vertex Cover problem. It is among the most fundamental graph-algorithmic problems. Following a…