scientific article
From MaRDI portal
Publication:2878212
zbMath1300.05204MaRDI QIDQ2878212
S. Arumugam, Martín Manrique, Karam Ebadi
Publication date: 28 August 2014
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 (8)
Complexity results on cosecure domination in graphs ⋮ Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang ⋮ Cosecure domination: hardness results and algorithms ⋮ Some new algorithmic results on co-secure domination in graphs ⋮ On the complexity of co-secure dominating set problem ⋮ Eternal and Secure Domination in Graphs ⋮ The co-secure domination in proper interval graphs ⋮ Co-Roman domination in graphs
This page was built for publication:
