On bounded-degree vertex deletion parameterized by treewidth
From MaRDI portal
Publication:765338
DOI10.1016/j.dam.2011.08.013zbMath1236.05064MaRDI QIDQ765338
Rolf Niedermeier, Robert Bredereck, Johannes Uhlmann, Nadja Betzler
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.08.013
parameterized complexity; vector dominating set; structural parameterization; \(k\)-dependent set; tree-likeness; co-\(k\)-plexes
05C07: Vertex degrees