FPT Algorithms for Generalized Feedback Vertex Set Problems

Download PDF
Open Webpage

Bin Sheng

Published: 01 Jan 2020, Last Modified: 05 Feb 2025TAMC 2020EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: An r-pseudoforest is a graph in which each component can be made into a forest by deleting at most r edges, and a d-quasi-forest is a graph in which each component can be made into a forest by deleting at most d vertices.