1 citations · 1 across the 1 of their papers we have counts for
1 paper · 1 filter
Jesse Racicot, Giovanni Rosso
Given a graph and an integer k, it is an NP-complete problem to decide whether there is a dominating set of size at most k. In this paper we study this problem for the Knödel G…