Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Top Cited Papers
- 31 December 2006
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 72 (8), 1386-1396
- https://doi.org/10.1016/j.jcss.2006.02.001
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Fixed-parameter tractability results for feedback set problems in tournamentsJournal of Discrete Algorithms, 2010
- Parameterized algorithms for feedback set problems and their duals in tournamentsTheoretical Computer Science, 2006
- Parameterized enumeration, transversals, and imperfect phylogeny reconstructionTheoretical Computer Science, 2006
- Faster algorithms for feedback vertex setElectronic Notes in Discrete Mathematics, 2005
- Planar graph bipartization in linear timeElectronic Notes in Discrete Mathematics, 2005
- Finding odd cycle transversalsOperations Research Letters, 2004
- Hierarchical Scaffolding With BambusGenome Research, 2004
- On enumerating all minimal solutions of feedback problemsDiscrete Applied Mathematics, 2002
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian InferenceSIAM Journal on Computing, 1998
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991