Unformatted text preview: weighted graph G , the length of the shortest Hamiltonian cycle in G . Describe and analyze a polynomialtime algorithm that computes, given an arbitrary weighted graph G , the shortest Hamiltonian cycle in G , using this magic black box as a subroutine. 3. Prove that the following problems are NPcomplete. (a) Given an undirected graph G , does G have a spanning tree in which every node has degree at most 17? (b) Given an undirected graph G , does G have a spanning tree with at most 42 leaves? 1...
View
Full Document
 Fall '08
 Chekuri,C
 Algorithms, Graph Theory, Computational complexity theory, Glossary of graph theory, magic black box

Click to edit the document details