The most vital nodes with respect to independent set and vertex cover
Given an undirected graph with weights on its vertices, the k k most vital nodes independent set (k k most vital nodes vertex cover) problem consists of determining a set of k k vertices whose removal results in the greatest decrease in the maximum weight of independent sets (minimum weight of vertex covers, respectively). We also consider the complementary problems, minimum node blocker independent set (minimum node blocker vertex cover) that consists of removing a subset of vertices of minimum size such that the maximum weight of independent sets (minimum weight of vertex covers, respectively) in the remaining graph is at most a specified value. We show that these problems are NP-hard on bipartite graphs but polynomial-time solvable on unweighted bipartite graphs. Furthermore, these problems are polynomial also on cographs and graphs of bounded treewidth. Results on the non-existence of ptas are presented, too.
independent set vertex cover np-hard bipartite graph cograph bounded treewidth most vital vertices time complexity