Fig. 3From: Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformaticsIllustrations for the Graph-Diet and Tree-Diet problems. Given a graph G on the left (treewidth 3), an optimal solution for Graph-Diet, with target treewidth 2, yields the tree-decomposition in the middle (edge ah is lost). On the other hand, any 1-tree-diet for the tree-decomposition on the right loses at least 3 edgesBack to article page