The k-SPANNING TREE problem is the following.
Input: An undirected graph G = (V, E)
Output: A spanning tree of G in which each node has degree ≤ k, if such
a tree exists.
Show that for any k ≥ 2:
(a) k-SPANNING TREE is a search problem.
(b) k-SPANNING TREE is NP-complete. (Hint: Start with k = 2 and consider the relation between this problem and RUDRATA PATH.)
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.