Unformatted text preview: (a) Show that minimum vertex cover is ﬁxed-parameter tractable with respect to branch-width by describing a dynamic program (give pseudo-code). (b) Recall that G ij is the graph induced by vertices at breadth-ﬁrst-search 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
This note was uploaded on 01/20/2012 for the course CS 6.889 taught by Professor Erikdemaine during the Fall '11 term at MIT.
- Fall '11