Hello,

I came across this problem from NWERC 2012: https://icpcarchive.ecs.baylor.edu/index.php?option=onlinejudge&page=show_problem&problem=4283

It seems like you need to use vertex cover and take advantage of the recursive structure. However, I'm warping my mind around it and I'm not still sure of how to solve it.

I would like to try to solve some basic vertex cover problems first and try to approach this later. Does anyone know a good problem from any online judge to recommend?

(I'm talking about the NP-Complete vertex cover on small instances, not vertex cover on bipartite graphs, trees, etc)