What’s the smallest set of nodes that is connected to all edges. This is an NP complete problem. The MIS problem is polynomial-time reducible to this problem
What’s the smallest set of nodes that is connected to all edges. This is an NP complete problem. The MIS problem is polynomial-time reducible to this problem