If you pick it you cant pick its direct children but

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: acent to u } return C (b) and (c) could be solved by the same algorithm as follows: The idea is that you can choose to pick a vertex or not. If you pick it, you can’t pick its direct children but can pick the minimum weight vertex from its grandchildren. We could compute the minimum weight of vertex cover and backtrack to output the vertexes. We add a field to each vertex structure called VC: VC = 0, indicating that this current node is not requi...
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