30 citations · 30 across the 1 of their papers we have counts for
1 paper · 1 filter
Wolfgang Barthel, Alexander K. Hartmann
Vertex cover is one of the classical NP-complete problems in theoretical computer science. A vertex cover of a graph is a subset of vertices such that for each edge at least one of…