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 modiﬁcation is NPComplete. You may assume HC is NPC. (c) Show that if you had a polynomial time algorithm for your modiﬁcation of MSC, then you could also solve MSC in polynomial time....
View
Full Document
 Fall '09
 Algorithms, Graph Theory, NPcomplete problems, disjunctive normal form

Click to edit the document details