算法概论第八章课后题 8.12
题目复述8.12. The k-spanning TREE problem is the following.
Input: An undirected graph G = (V, E)
Output: A spanning tree of G in which each has degree <=<= k, if such a tree exits.
show that for k >= 2
原创
2017-12-30 21:23:16 ·
220 阅读 ·
0 评论