Parameterized algorithms for feedback set problems and their duals in tournaments
- 28 February 2006
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 351 (3), 446-458
- https://doi.org/10.1016/j.tcs.2005.10.010
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Ranking TournamentsSIAM Journal on Discrete Mathematics, 2006
- Faster algorithms for feedback vertex setElectronic Notes in Discrete Mathematics, 2005
- On the existence of subexponential parameterized algorithmsJournal of Computer and System Sciences, 2003
- Analogs & duals of the MAST problem for sequences & treesJournal of Algorithms, 2003
- An efficient fixed-parameter algorithm for 3-Hitting SetJournal of Discrete Algorithms, 2003
- Parameterized complexity of finding subgraphs with hereditary propertiesTheoretical Computer Science, 2002
- Parameterizing above Guaranteed Values: MaxSat and MaxCutJournal of Algorithms, 1999
- A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability ProblemCanadian Journal of Mathematics, 1982
- Girth in digraphsJournal of Graph Theory, 1980
- Finding a Minimum Circuit in a GraphSIAM Journal on Computing, 1978