Fixed-parameter tractability results for feedback set problems in tournaments
- 31 March 2010
- journal article
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 8 (1), 76-86
- https://doi.org/10.1016/j.jda.2009.08.001
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Aggregating inconsistent informationJournal of the ACM, 2008
- A fixed-parameter algorithm for the directed feedback vertex set problemJournal of the ACM, 2008
- Improved algorithms for feedback vertex set problemsJournal of Computer and System Sciences, 2008
- An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set ProblemTheory of Computing Systems, 2007
- A survey on the linear ordering problem for weighted or unweighted tournaments4OR, 2007
- The Minimum Feedback Arc Set Problem is NP-Hard for TournamentsCombinatorics, Probability and Computing, 2006
- Ranking TournamentsSIAM Journal on Discrete Mathematics, 2006
- A Min-Max Theorem on Feedback Vertex SetsMathematics of Operations Research, 2002
- An Approximation Algorithm for Feedback Vertex Sets in TournamentsSIAM Journal on Computing, 2001
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphsInformation Processing Letters, 1992