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
 Fall '13
 zhang
 Algorithms, Graph Theory, Vertex

Click to edit the document details