A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem

DOI10.1016/j.tcs.2018.06.040zbMath1407.68352OpenAlexW2809868749MaRDI QIDQ1625600

Lawrence L. Larmore, Stéphane Devismes, Ajoy K. Datta

Publication date: 29 November 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.06.040

zbMATH Keywords

dominating setself-stabilizationunisonproof labeling scheme

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Competitive self-stabilizing \(k\)-clustering
• Self-stabilizing leader election in polynomial steps
• An \(O(n)\)-time self-stabilizing leader election algorithm
• A self-stabilizing \(k\)-clustering algorithm for weighted graphs
• Self-stabilizing leader election in optimal space under an arbitrary scheduler
• Synchronous vs. asynchronous unison
• Principles of distributed systems. 10th international conference, OPODIS 2006, Bordeaux, France, December 12--15, 2006. Proceedings
• Robust self-stabilizing weight-based clustering algorithm
• Fast, silent self-stabilizing distance-\(k\) independent dominating set construction
• On probabilistic snap-stabilization
• Proof labeling schemes
• Self-stabilizing systems in spite of distributed control
• Fast Distributed Construction of Smallk-Dominating Sets and Applications
• What Can be Computed Locally?
• When graph theory helps self-stabilization

This page was built for publication: A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem