Feedback vertex set on graphs of low clique-width
Authors:
- 1 April 2013
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 34 (3) , 666-679
Abstract
No abstract availableKeywords
Funding Information
- Czech Ministry of Education (1M0545)
This publication has 20 references indexed in Scilit:
- On parse trees and Myhill–Nerode-type tools for handling graphs of bounded rank-widthDiscrete Applied Mathematics, 2010
- -join decomposable graphs and algorithms with runtime single exponential in rankwidthDiscrete Applied Mathematics, 2010
- Clique-width of graphs defined by one-vertex extensionsDiscrete Mathematics, 2008
- On the Minimum Feedback Vertex Set Problem: Exact and Enumeration AlgorithmsAlgorithmica, 2007
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartizationJournal of Computer and System Sciences, 2006
- Approximating clique-width and branch-widthJournal of Combinatorial Theory, Series B, 2006
- Faster fixed parameter tractable algorithms for finding feedback vertex setsACM Transactions on Algorithms, 2006
- Wavelength Conversion in Optical NetworksJournal of Algorithms, 2001
- A primal–dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphsOperations Research Letters, 1998
- Graph minors. X. Obstructions to tree-decompositionJournal of Combinatorial Theory, Series B, 1991