12 citations · 25 across the 6 of their papers we have counts for
1 paper · 2 filters
Vadim Lozin, Dmitriy Malyshev, Raffaele Mosca +1
Weighted independent domination is an NP-hard graph problem, which remains computationally intractable in many restricted graph classes. In particular, the problem is NP-hard in th…