A parameterized algorithm for subset feedback vertex set in tournaments
From MaRDI portal
Cites work
- A fixed-parameter algorithm for the directed feedback vertex set problem
- A randomized polynomial kernel for subset feedback vertex set
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Aggregating inconsistent information: ranking and clustering
- An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
- Directed subset feedback vertex set is fixed-parameter tractable
- Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs
- Faster deterministic \textsc{Feedback Vertex Set}
- Faster exact and parameterized algorithm for feedback vertex set in bipartite tournaments
- Faster exact and parameterized algorithm for feedback vertex set in tournaments
- Faster fixed parameter tractable algorithms for finding feedback vertex sets
- Feedback vertex set and even cycle transversal for H-free graphs: finding large block graphs
- Fixed-parameter complexity of feedback vertex set in bipartite tournaments
- Fixed-parameter tractability results for feedback set problems in tournaments
- Half-integrality, LP-branching, and FPT algorithms
- scientific article; zbMATH DE number 125608 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- Improved algorithms for feedback vertex set problems
- Improved analysis of highest-degree branching for feedback vertex set
- Improved FPT algorithm for feedback vertex set problem in bipartite tournament
- Kernelization Algorithms for d-Hitting Set Problems
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
- ON DISJOINT CYCLES
- On feedback vertex set: new measure and new structures
- Parameterized algorithms
- Parameterized and Exact Computation
- Parameterized and Exact Computation
- Reducibility among combinatorial problems
- Subquadratic kernels for implicit 3-{\textsc{Hitting Set}} and 3-{\textsc{Set Packing}} problems
- Subset feedback vertex set on graphs of bounded independent set size
- Subset feedback vertex sets in chordal graphs
- Two-uniqueness of rational ghost soliton solution and well-posedness of perturbed Einstein-Yang-Mills equations
Cited in
(9)- Fixed-parameter tractability results for feedback set problems in tournaments
- Improved Bounds for Minimal Feedback Vertex Sets in Tournaments
- 2-Approximating Feedback Vertex Set in Tournaments
- Breaking the barrier 2ᵏ for subset feedback vertex set in chordal graphs
- Subset feedback vertex set in tournaments as fast as without the subset
- Solving subset feedback vertex set in chordal graphs faster than 2ᵏ
- Subset feedback vertex set and subset vertex cover on AT-free graphs
- Subset feedback vertex set in tournaments as fast as without the subset
- Parameterized algorithms for feedback set problems and their duals in tournaments
This page was built for publication: A parameterized algorithm for subset feedback vertex set in tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076355)
