63 citations · 63 across the 1 of their papers we have counts for
1 paper · 1 filter
Alexander K. Hartmann, Martin Weigt
The vertex-cover problem is studied for random graphs GN,cN having N vertices and cN edges. Exact numerical results are obtained by a branch-and-bound algorithm. It is fou…