A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model

DOI10.1016/j.camwa.2007.01.021zbMath1125.68011OpenAlexW2040141350MaRDI QIDQ2460592

Cheng-Pin Wang, Chih-Yuan Chen, Tetz C. Huang, Ji-Cherng Lin

Publication date: 12 November 2007

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2007.01.021

zbMATH Keywords

cut pointSelf-stabilizing algorithmcentral demon modeldistributed demon modelminimal 2-dominating set

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

Efficient transformation of distance-2 self-stabilizing algorithms ⋮ A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs ⋮ Self-Stabilizing Domination Algorithms

Cites Work

• A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
• A belated proof of self-stabilization
• Parallel concepts in graph theory
• Self-stabilizing systems in spite of distributed control
• Token systems that self-stabilize
• Unnamed Item
• Unnamed Item