We can use dynamic programming on the treedecomposition to find an optimal solution in linear time.
我们可以使用树分解的动态规划在线性时间内找到最优解。
2
Since the forbidden minor is planar, the class has bounded treewidth, and we can extract a suitable treedecomposition in linear time.
自从禁止未成年人是平面的，该类有界树宽，我们可以提取的线性时间合适的树分解。
3
In the procedure of path decomposition and query plan selection, target node in the query tree is utilized to avoid the transfer of the intermediate results.