Linear time parameterized algorithms for subset feedback vertex set
From MaRDI portal
Recommendations
Cites work
- A c^k n 5-approximation algorithm for treewidth
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A near-optimal planarization algorithm
- A nearly linear time algorithm for the half integral parity disjoint paths packing problem
- A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory–
- Almost 2-SAT is fixed-parameter tractable
- An improved parameterized algorithm for the minimum node multiway cut problem
- Directed Subset Feedback Vertex Set is fixed-parameter tractable
- Dividing a Graph into Triconnected Components
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- Faster deterministic \textsc{Feedback Vertex Set}
- Faster fixed parameter tractable algorithms for finding feedback vertex sets
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
- Graph minors. XIII: The disjoint paths problem
- Graph theory
- Half-integrality, LP-branching and FPT algorithms
- Half-integrality, LP-branching, and FPT algorithms
- scientific article; zbMATH DE number 5485529 (Why is no real title available?)
- scientific article; zbMATH DE number 5485559 (Why is no real title available?)
- scientific article; zbMATH DE number 6297714 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Improved algorithms for feedback vertex set problems
- Linear time parameterized algorithms via skew-symmetric multicuts
- Linear-time FPT algorithms via network flow
- On feedback vertex set new measure and new structures
- Parameterized graph separation problems
- Parameterized tractability of multiway cut with parity constraints
- Planar subgraph isomorphism revisited
- Planarity Allowing Few Error Vertices in Linear Time
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- The disjoint paths problem in quadratic time
- Which problems have strongly exponential complexity?
Cited in
(11)- A randomized polynomial kernel for subset feedback vertex set
- New algorithms for maximum disjoint paths based on tree-likeness
- Linear time parameterized algorithms for \textsc{Subset Feedback Vertex Set}
- Directed subset feedback vertex set is fixed-parameter tractable
- A parameterized complexity view on collapsing \(k\)-cores
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover
- scientific article; zbMATH DE number 7278081 (Why is no real title available?)
- Hitting selected (odd) cycles
- Deletion to scattered graph classes. I: Case of finite number of graph classes
- A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs
- Linear kernels and linear-time algorithms for finding large cuts
This page was built for publication: Linear time parameterized algorithms for subset feedback vertex set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3448850)
