Fig. 5From: Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformaticsReduction for Theorem 4 showing that Tree-Diet is NP-hard even for \(d=1\), from a graph G (left) with \(k=3\) and \(n=3\) to a graph \(G'\) (right, given by its tree-decomposition of width \(N+n+1\)): a 1-tree-diet for \(G'\) amounts to selecting a k-clique in the root bag, i.e. in GBack to article page