2 Prove the following problems are NP hard (a) Given an undirected graph G, does G contain a simple path that visits all but 17 vertices (b) Given an undirected graph G with weighted edges, compute a maximum diameter spanning tree of G (The diameter of a tree T is the length of a longest path in T )

Question

2  Prove the following problems are NP hard  (a) Given an undirected graph G, does G contain a simple path that visits all but 17 vertices  (b) Given an undirected graph G with weighted edges, compute a maximum diameter spanning tree of G  (The diameter of a tree T is the length of a longest path in T )

SolutionInn · Accepted Answer

The Answer is in the image, click to view ...

Question: 2. Prove the following problems are NP-hard. (a) Given an undirected graph G, does G contain a simple path that visits all but 17 vertices?

Step by Step Solution