This preview shows page 1. Sign up to view the full content.
Unformatted text preview: (a) Show that minimum vertex cover is xedparameter tractable with respect to branchwidth by describing a dynamic program (give pseudocode). (b) Recall that G ij is the graph induced by vertices at breadthrstsearch levels jk + i through ( j + 1) k + i . Explain why a solution to the rst part can be used to nd a minimum vertex cover of G ij in 2 O ( k ) n time....
View Full
Document
 Fall '11
 ErikDemaine
 Algorithms

Click to edit the document details