13-122/III - Sequential Monte Carlo for Counting Vertex Covers in General Graphs

• Authors
  Radislav Vaisman, Technion, Haifa, Israel; Zdravko Botev, University of New South Wales, Sidney, Australia; Ad Ridder, VU University Amsterdam
• Publication date
  August 26, 2013

• Keywords
  Vertex Cover, Counting problem, Sequential importance sampling, Dynamic Programming, Relaxation, Random Graphs
• JEL
  C61, C63