Linear time parameterized algorithms for \textsc{Subset Feedback Vertex Set}
From MaRDI portal
Publication:4554952
Recommendations
Cited in
(16)- Linear time parameterized algorithms for subset feedback vertex set
- Directed subset feedback vertex set is fixed-parameter tractable
- Linear-time FPT algorithms via network flow
- An improved FPT algorithm for independent feedback vertex set
- Improved FPT Algorithms for Deletion to Forest-Like Structures.
- Close relatives of feedback vertex set without single-exponential algorithms parameterized by treewidth
- Improved FPT Algorithms for Deletion to Forest-Like Structures
- When recursion is better than iteration: a linear-time algorithm for directed acyclicity with few error vertices
- Parameterized complexity classification for interval constraints
- Roman cycle hitting set
- A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs
- Subset feedback vertex set parameterized by multiway cut is FPT
- Parameterized complexity of feedback vertex set with connectivity constraints
- An FPT algorithm for edge subset feedback edge set
- Multi-budgeted directed cuts
- A parameterized complexity view on collapsing \(k\)-cores
This page was built for publication: Linear time parameterized algorithms for \textsc{Subset Feedback Vertex Set}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554952)