A new distributed algorithm for computing a dominating set on grids

DOI10.1007/978-3-319-19647-3_21MaRDI QIDQ3452568zbMATH OpenOpenAlexFDO

Authors Photchchara Pisantechakool, Xuehou Tan

Publication date 12 November 2015

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-19647-3_21

zbMATH Keywords

distributed grid domination problemdominating setgrid domination problemsensor network

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1990832
• A distributed algorithm to find \(k\)-dominating sets
• scientific article; zbMATH DE number 139923
• Total domination of grid graphs
• An efficient distributed algorithm for constructing small dominating sets

Cites work

• Computing the domination number of grid graphs
• Graph theory
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• The domination number of grids

Cited in

(2)

• scientific article; zbMATH DE number 139923 (Why is no real title available?)
• An explicit construction of optimal dominating and [1, 2]–dominating sets in grid

This page was built for publication: A new distributed algorithm for computing a dominating set on grids

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