Pages that link to "Item:Q1686068"
From MaRDI portal
The following pages link to Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068):
Displaying 7 items.
- Faster deterministic algorithm for cactus vertex deletion (Q2094388) (← links)
- FPT algorithms for generalized feedback vertex set problems (Q2110739) (← links)
- Fixed parameterized algorithms for generalized feedback vertex set problems (Q2693637) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q4637327) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures. (Q6065438) (← links)
- (Q6089665) (← links)
- Deletion to scattered graph classes. I: Case of finite number of graph classes (Q6133645) (← links)