This preview shows page 1. Sign up to view the full content.
Unformatted text preview: (IS) is NPC. 3. Let Minimum Degree Spanning Tree (MDST) problem be: Input: A graph G = ( V,E ). Output: A spanning tree of G with minimum degree. (a) How would you modify this problem so that it is in NP? (b) Show that your modication is NP-Complete. You may assume HC is NPC. (c) Show that if you had a polynomial time algorithm for your modication of MSC, then you could also solve MSC in polynomial time....
View Full Document
- Fall '09