Pages that link to "Item:Q955350"
From MaRDI portal
The following pages link to Improved algorithms for feedback vertex set problems (Q955350):
Displaying 8 items.
- (Q5140722) (← links)
- Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) (Q5741082) (← links)
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5895104) (← links)
- An improved FPT algorithm for independent feedback vertex set (Q5918287) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures. (Q6065438) (← links)
- A parameterized algorithm for subset feedback vertex set in tournaments (Q6076355) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures (Q6492092) (← links)