A parameterized algorithm for subset feedback vertex set in tournaments

DOI10.1016/j.tcs.2023.114139OpenAlexW4386102044MaRDI QIDQ6076355

Tian Bai, Mingyu Xiao

Publication date: 21 September 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114139

zbMATH Keywords

tournamentsparameterized algorithmssubset feedback vertex setiterative compression

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On feedback vertex set: new measure and new structures
• Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
• Improved algorithms for feedback vertex set problems
• A randomized polynomial kernel for subset feedback vertex set
• Faster deterministic \textsc{Feedback Vertex Set}
• Improved analysis of highest-degree branching for feedback vertex set
• Two-uniqueness of rational ghost soliton solution and well-posedness of perturbed Einstein-Yang-Mills equations
• Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
• Fixed-parameter tractability results for feedback set problems in tournaments
• Subset feedback vertex set on graphs of bounded independent set size
• Improved FPT algorithm for feedback vertex set problem in bipartite tournament
• Subset feedback vertex sets in chordal graphs
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Half-integrality, LP-branching, and FPT Algorithms
• Faster fixed parameter tractable algorithms for finding feedback vertex sets
• Subset Feedback Vertex Set Is Fixed-Parameter Tractable
• Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite Tournaments
• A fixed-parameter algorithm for the directed feedback vertex set problem
• Kernelization Algorithms for d-Hitting Set Problems
• ON DISJOINT CYCLES
• An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem
• Subquadratic Kernels for Implicit 3-H <scp>itting</scp> S <scp>et</scp> and 3-S <scp>et</scp> P <scp>acking</scp> Problems
• Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
• Reducibility among Combinatorial Problems
• Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs
• Parameterized and Exact Computation
• Parameterized and Exact Computation
• Parameterized Algorithms
• Aggregating inconsistent information
• Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs
• Subset feedback vertex set in chordal and split graphs
• Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
• Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs

This page was built for publication: A parameterized algorithm for subset feedback vertex set in tournaments