A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon

DOI10.1016/j.ipl.2014.04.011zbMath1371.68033OpenAlexW2027648323MaRDI QIDQ2015142

Chiuyuan Chen, Well Y. Chiu, Shih-Yu Tsai

Publication date: 23 June 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.04.011

zbMATH Keywords

graph algorithmfault tolerancedominationdistributed computingself-stabilizing algorithm

Mathematics Subject Classification ID

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

Related Items (5)

Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs ⋮ Self-stabilizing 2-minimal dominating set algorithms based on loop composition ⋮ Brief announcement: Fully lattice linear algorithms ⋮ Self-Stabilizing Domination Algorithms ⋮ A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs

Cites Work

• Unnamed Item
• Efficient transformation of distance-2 self-stabilizing algorithms
• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
• Distance-\(k\) knowledge in self-stabilizing algorithms
• Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
• Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs
• Self-stabilizing systems in spite of distributed control
• Distributed Computing - IWDC 2003

This page was built for publication: A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon