Improved FPT algorithm for feedback vertex set problem in bipartite tournament

DOI10.1016/J.IPL.2007.08.014MaRDI QIDQ2380045zbMATH OpenOpenAlexFDO

Authors Prashant Sasatte

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.08.014

zbMATH Keywords

algorithmsparameterized complexitybipartite tournamentfeedback set problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Faster exact and parameterized algorithm for feedback vertex set in bipartite tournaments
• Faster exact and parameterized algorithm for feedback vertex set in tournaments
• Fixed-parameter complexity of feedback vertex set in bipartite tournaments
• Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
• Linear programming based approximation algorithms for feedback set problems in bipartite tournaments

Cites work

• A Min-Max Theorem on Feedback Vertex Sets
• An approximation algorithm for feedback vertex sets in tournaments
• Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
• Parameterized Algorithms for Hitting Set: The Weighted Case

Cited in

(5)

• Faster exact and parameterized algorithm for feedback vertex set in tournaments
• A parameterized algorithm for subset feedback vertex set in tournaments
• Faster exact and parameterized algorithm for feedback vertex set in bipartite tournaments
• A quadratic vertex kernel for feedback arc set in bipartite tournaments
• Fixed-parameter tractability results for feedback set problems in tournaments

This page was built for publication: Improved FPT algorithm for feedback vertex set problem in bipartite tournament

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380045)