Mim-Width II. The Feedback Vertex Set Problem
- 18 July 2019
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 82 (1) , 118-145
Abstract
No abstract availableKeywords
Funding Information
- Bergens Forskningsstiftelse
- H2020 European Research Council (648527)
- National Research Foundation of Korea (NRF-2018R1D1A1B07050294)
This publication has 26 references indexed in Scilit:
- Feedback vertex set on graphs of low clique-widthEuropean Journal of Combinatorics, 2013
- On the parameterized complexity of multiple-interval graph problemsTheoretical Computer Science, 2009
- Improved algorithms for feedback vertex set problemsJournal of Computer and System Sciences, 2008
- Feedback vertex set on AT-free graphsDiscrete Applied Mathematics, 2008
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartizationJournal of Computer and System Sciences, 2006
- Faster fixed parameter tractable algorithms for finding feedback vertex setsACM Transactions on Algorithms, 2006
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problemsJournal of Computer and System Sciences, 2003
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSESInternational Journal of Foundations of Computer Science, 2000
- Fixed-Parameter Tractability and Completeness I: Basic ResultsSIAM Journal on Computing, 1995
- ON DISJOINT CYCLESInternational Journal of Foundations of Computer Science, 1994