Help — Modified Minimum Path Cover Problems for Trees

Revision en3, by dead_lock, 2016-04-23 17:28:35

Given a Treen with n nodes and n - 1 edges, I have to answer Q queries. In every query, I get a list of nodes of size k,
n1, n2, ..., nk. I need to answer the minimum number of paths that are required that cover all of these nodes.See the example for better insight

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English dead_lock 2016-04-23 17:28:35 0 (published)
en2 English dead_lock 2016-04-23 17:28:13 44 (saved to drafts)
en1 English dead_lock 2016-04-23 17:11:47 381 Initial revision (published)