排序方式： 共有1条查询结果，搜索用时 0 毫秒
1
1.
ZhangShaoqiang LiGuojun SohnMoo-Young 《高校应用数学学报(英文版)》2004,19(2):149-154
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 feedback edge set problem efficiently by using dynamic programming on a tree-decomposition. 相似文献
1