An improved FPT algorithm for Almost Forest Deletion problem

Published: 2018, Last Modified: 01 Oct 2024Inf. Process. Lett. 2018EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•Studying a generalization of the FVS problem, called Almost Forest Deletion problem.•Presenting some reduction rules and branching rules to deal with the problem.•Introducing a measure with uniform coefficient to analyze the branching algorithm.•Developing a new parameterized algorithm with running time O⁎(5k4l) for the problem.
Loading