# ps4 - (a Show that minimum vertex cover is ﬁxed-parameter...

This preview shows page 1. Sign up to view the full content.

6.889: Algorithms for Planar Graphs and Beyond October 5, 2011 Problem Set 4 This problem set is due Wednesday, October 12 at noon. 1. (a) Show that if C is the vertex set of a clique in a graph G , then the treewidth of G is at least | C | - 1. (b) Show that if the treewidth of a graph G is k , then G has a vertex of degree at most k . 2. In class we presented Baker’s technique using minimum vertex cover as an example. In this problem we ﬁll in the missing details.
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online