I'm currently working on my Master's thesis and my cause would be helped a lot of there existed an (efficient) algorithm for deciding if a given tree $G$ contains a forest $H$ as an induced subforest. Does anyone know if such an algorithm already exists?
There do already exist (very) efficient algorithms for deciding this if $H$ is a tree.
(See for example: https://www.sciencedirect.com/science/article/abs/pii/S0196677499910441 )