Movable dominating sensor sets in networks

MaRDI QIDQ3089221zbMATH OpenFDO

Authors Jean R. S. Blair, Ralucca Gera, Steve Horton

Publication date 24 August 2011

zbMATH Keywords

networksdominationmovable domninating setsmovable sensors

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Movable resolving domination in graphs
• The probabilistic minimum dominating set problem
• Downsizing a dominating set
• The probabilistic min dominating set problem
• Vertex Domination in Dynamic Networks

Cited in

(11)

• Movable resolving domination in graphs
• 1-MOVABLE DOUBLE DOMINATION IN SOME BINARY OPERATIONS OF GRAPHS
• SOME CHARACTERIZATIONS OF 1-MOVABLE RESTRAINED CONNECTED DOMINATING SETS IN THE JOIN OF GRAPHS
• Downsizing a dominating set
• Algorithms and Computation
• Vertex Domination in Dynamic Networks
• 1-MOVABLE 2-PERFECT DOMINATING SET IN GRAPHS
• 1-movable double outer-independent domination in graphs
• scientific article; zbMATH DE number 7727296 (Why is no real title available?)
• Efficient sensor network design for continuous monitoring of moving objects
• MOVABLE DIFFERENTIATING-DOMINATION IN GRAPHS

This page was built for publication: Movable dominating sensor sets in networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089221)