A distributed algorithm to find \(k\)-dominating sets

DOI10.1016/S0166-218X(03)00368-8zbMath1043.05109OpenAlexW2165479724MaRDI QIDQ1827867

Valmir C. Barbosa, Lucia Draque Penso

Publication date: 6 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00368-8

zbMATH Keywords

Distributed algorithmsGraph algorithms\(k\)-Dominating sets

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Fast deterministic distributed algorithms for sparse spanners ⋮ An efficient distributed algorithm for canonical labeling on directed split-stars

Cites Work

• Unnamed Item
• Fast Distributed Construction of Smallk-Dominating Sets and Applications
• How to Allocate Network Centers
• A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
• A trade-off between space and efficiency for routing tables

This page was built for publication: A distributed algorithm to find \(k\)-dominating sets