A Problem on DP on Trees

Правка en2, от FineLine, 2017-01-13 19:16:57

Hello Everyone ,I am trying to solve this problem for some time now.I could not find an explanation in English for it anywhere . The question is related to DP (on trees) . In Brief the problem asks you to find the minimum number of edges to be removed to isolate a subtree of size p .The original problem statement can be seen here.Thanks in advance :)

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский FineLine 2017-01-13 19:16:57 166 Tiny change: 'n trees) .In Brief t' -> 'n trees) .\nIn Brief t'
en1 Английский FineLine 2017-01-13 16:50:11 270 Initial revision (published)