๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A distributed algorithm for k-dominating sets

โœ Scribed by Lucia Draque Penso; Valmir Carneiro Barbosa

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
213 KB
Volume
7
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A self-stabilizing algorithm for finding
A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model
โœ Tetz C. Huang; Ji-Cherng Lin; Chih-Yuan Chen; Cheng-Pin Wang ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 202 KB

A 2-dominating set in a distributed system is a set of processors such that each processor outside the set has at least two neighbors in the set. In applications, a 2-dominating set can be considered as an ideal place in the system for allocating resources, and a minimal 2-dominating set allows for

Distributed algorithms for finding the u
Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars
โœ Fu-Hsing Wang; Jou-Ming Chang; Yue-Li Wang; Sun-Jen Huang ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 191 KB

A distance-k dominating set D of a directed graph G is a set of vertices such that for every vertex v of G; there is a vertex uAD and the distance between u and v is at most k: Minimum distance-k dominating set is especially important in communication networks for distributed data structures and for