the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are dualJiong Guo,Rolf Niedermeier,Sebastian Wernickemag(2008)引用 23|浏览3暂无评分AI 理解论文溯源树样例生成溯源树,研究论文发展脉络Chat Paper正在生成论文摘要