scientific article; zbMATH DE number 7388346
From MaRDI portal
Publication:5011945
zbMath1488.05381MaRDI QIDQ5011945
N. Javari Rad, M. Farhadi Jalalvand
Publication date: 30 August 2021
Full work available at URL: http://www.montis.pmf.ac.me/vol40/4.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-completeness\(k\)-hop dominating set\(k\)-step dominating set\(k\)-step domination number\(k\)-hop domination numberstep dominating set
Planar graphs; geometric and topological aspects of graph theory (05C10) 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)
An optimal algorithm to find minimum k-hop dominating set of interval graphs ⋮ An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs ⋮ On the complexity of some hop domination parameters
This page was built for publication:
