Improving a fixed parameter tractability
✍
Peter Heusch; Stefan Porschen; Ewald Speckenmeyer
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 238 KB
Consider a forest of k trees and n nodes together with a (partial) function s mapping leaves of the trees to non-root nodes of other trees. Define the shadow of a leaf c to be the subtree rooted at sðcÞ: The shadow problem asks whether there is a set S of leaves exactly one from each tree such that