Subset feedback vertex set parameterized by multiway cut is FPT
From MaRDI portal
Cites work
- A 4k^2 kernel for feedback vertex set
- A cubic kernel for feedback vertex set and loop cutset
- A naive algorithm for feedback vertex set
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Detecting Feedback Vertex Sets of Size k in O ⋆ (2.7 k ) Time
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- Faster fixed parameter tractable algorithms for finding feedback vertex sets
- Feedback vertex set inspired kernel for chordal vertex deletion
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- Graph theory
- Half-integrality, LP-branching, and FPT algorithms
- Improved algorithms for feedback vertex set problems
- Linear time parameterized algorithms for \textsc{Subset Feedback Vertex Set}
- Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
- On group feedback vertex set parameterized by the size of the cutset
- Parameterized algorithms
- Reducibility among combinatorial problems
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Steiner tree parameterized by multiway cut and even less
- Subset feedback vertex set is fixed-parameter tractable
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
- Which problems have strongly exponential complexity?
This page was built for publication: Subset feedback vertex set parameterized by multiway cut is FPT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294422)
