Question: Dynamic programming can also work well on tree structures. Let us call a subset S of vertices a blanket if every edge is adjacent to
Dynamic programming can also work well on tree structures. Let us call a subset S of vertices a blanket if every edge is adjacent to at least one vertex of S. Suppose that we wish to find the minimum sized blanket for a tree. Find an algorithm that finds a minimum-sized blanket of a tree and runs in time O(|V|); also give the space used by your algorithm.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
