论文部分内容阅读
Many difficult (often NP-complete) optimization problems can be solved efficiently on graphs of small tree-width with a given tree decomposition. In this paper,it is discussed how to solve the minimum feedback vertex set problem and the minimum vertex fee