scientific article
From MaRDI portal
Publication:2908840
DOI10.4230/LIPIcs.FSTTCS.2010.96zbMath1245.68094MaRDI QIDQ2908840
Saket Saurabh, Neeldhara Misra, Venkatesh Raman, Geevarghese Philip
Publication date: 29 August 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_f71a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
The kernelization complexity of connected domination in graphs with (no) small cycles ⋮ On the parameterized complexity of vertex cover and edge cover with connectivity constraints ⋮ Domination When the Stars Are Out
This page was built for publication:
