𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs

✍ Scribed by Belhoul, Yacine; Yahiaoui, Saïd; Kheddouci, Hamamache

Book ID
122941196
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
209 KB
Volume
114
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Comb
[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 8288 || Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs
✍ Lecroq, Thierry; Mouchard, Laurent 📂 Article 📅 2013 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 222 KB

This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and

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