21 citations · 31 across the 6 of their papers we have counts for
1 paper · 1 filter
Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle
Many NP-hard problems, such as Dominating Set, are FPT parameterized by clique-width. For graphs of clique-width k given with a k-expression, Dominating Set can be solved in $4…