The many facets of upper domination
From MaRDI portal
Publication:1704853
DOI10.1016/j.tcs.2017.05.042zbMath1388.68099MaRDI QIDQ1704853
Henning Fernau, Vangelis Th. Paschos, Cristina Bazgan, Jérôme Monnot, Klaus Jansen, Mathieu Liedloff, Michael Lampis, Ljiljana Brankovic, Katrin Casel, Kim-Manuel Klein
Publication date: 13 March 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.05.042
dominating set; extension problems; bounded-degree graphs; (in)approximability; fixed parameter (in)tractability
68Q25: Analysis of algorithms and problem complexity
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
68W25: Approximation algorithms