Given a connected graph G(V, E), we wish to find a spanning tree that has the minimum number of leaves (a leaf is a node with degree one.)
这个问题是NP问题?
我想了很久都不知道怎么证明,开始想到归约到节点覆盖问题,后来觉得证不出来,所以现在很苦恼,大虾帮帮忙啊~
...全文
1233打赏收藏
郁闷,关于证明一个问题的NPC归约问题
Given a connected graph G(V, E), we wish to find a spanning tree that has the minimum number of leaves (a leaf is a node with degree one.) 这个问题是NP问题? 我想了很久都不知道怎么证明,开始想到归约到节点覆盖问题,后来觉得证不出来,所以现在很苦恼,大虾帮帮忙啊~