The recursive function is summarized as follows

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

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: red to be in the vertex cover set. VC = 1, indicating that this current node is in the vertex cover set For each node, we compute the minimal weight of vertex cover with and without the current node, VC1(the current node is chosen) and VC0 (the current node is not chosen). The recursive function is summarized as follows: If (current node x is leaf node) VC1 = w(x); VC0 = 0; else if (the current node has c...
View Full Document

This note was uploaded on 10/26/2013 for the course CS 22C:31 taught by Professor Zhang during the Fall '13 term at University of Iowa.

Ask a homework question - tutors are online