Pages that link to "Item:Q4637327"
From MaRDI portal
The following pages link to Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q4637327):
Displaying 14 items.
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
- A faster parameterized algorithm for pseudoforest deletion (Q1693129) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- Constant factor approximation algorithm for \(l\)-pseudoforest deletion problem (Q1791042) (← links)
- FPT algorithms for generalized feedback vertex set problems (Q2110739) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- An approximation algorithm for the \(l\)-pseudoforest deletion problem (Q2285146) (← links)
- Fixed parameterized algorithms for generalized feedback vertex set problems (Q2693637) (← 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)
- Improved FPT Algorithms for Deletion to Forest-Like Structures (Q6492092) (← links)
- Faster parameterized algorithm for \(r\)-pseudoforest deletion (Q6664062) (← links)
