Self-stabilizing 2-minimal dominating set algorithms based on loop composition

DOI10.1016/j.tcs.2023.114314OpenAlexW4388817963MaRDI QIDQ6144026

Hirotsugu Kakugawa, Yuichi Sudo, Sayaka Kamei, Syohei Maruyama

Publication date: 5 January 2024

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

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

zbMATH Keywords

girthdominating setself-stabilization2-minimalityloop composition

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The expressive power of snap-stabilization
• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• An \(O(n)\)-time self-stabilizing leader election algorithm
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
• Robust self-stabilizing weight-based clustering algorithm
• On generalised minimal domination parameters for paths
• A self-stabilizing algorithm for constructing breadth-first trees
• A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon
• Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
• An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
• Self-stabilizing systems in spite of distributed control
• Self-Stabilizing Algorithm for Minimal Dominating Set with Safe Convergence in an Arbitrary Graph
• Distributed Computing - IWDC 2003