,
Yuma Tamura
Creative Commons Attribution 4.0 International license
Enumerating all inclusion-minimal solutions is a powerful approach to designing fixed-parameter tractable (FPT) algorithms. However, for the Feedback Vertex Set problem, this approach faces a fundamental obstacle, as the number of minimal feedback vertex sets is not, in general, bounded by any function of the solution size k. To overcome this limitation, we introduce a data structure called a k-product list, which implicitly encodes all minimal solutions while admitting non-minimal ones to maintain efficiency. We present FPT algorithms for computing such lists not only for the Feedback Vertex Set problem but also for its natural generalizations, the 𝓁-Forest Deletion Set problem and the r-Pseudoforest Deletion Set problem. Our framework yields simple FPT algorithms for a wide range of variants, providing the first such results in several cases and demonstrating the broad applicability of our approach.
@InProceedings{saito_et_al:LIPIcs.IPEC.2026.25,
author = {Saito, Rin and Tamura, Yuma},
title = {{k-Product Lists for (Generalized) Feedback Vertex Sets: A Tool for Designing FPT Algorithms}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {25:1--25:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.25},
URN = {urn:nbn:de:0030-drops-281986},
doi = {10.4230/LIPIcs.IPEC.2026.25},
annote = {Keywords: Graph Algorithms, Fixed-Parameter Tractability, Feedback Vertex Set}
}