Efficient transformation of distance-2 self-stabilizing algorithms

DOI10.1016/J.JPDC.2011.12.008zbMath1242.68366OpenAlexW2000046463MaRDI QIDQ433436

Volker Turau

Publication date: 13 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2011.12.008

zbMATH Keywords

distributed algorithmsself-stabilizationfault-tolerant algorithms

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (12)

Self-stabilizing algorithms for minimal global powerful alliance sets in graphs ⋮ A fast approximation algorithm for the maximum 2-packing set problem on planar graphs ⋮ Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs ⋮ Self-stabilizing algorithms for efficient sets of graphs and trees ⋮ Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs ⋮ A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler ⋮ Algorithm to find a maximum 2-packing set in a cactus ⋮ A self-stabilizing algorithm for edge monitoring in wireless sensor networks ⋮ A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon ⋮ A genetic algorithm for the maximum 2-packing set problem ⋮ Self-Stabilizing Domination Algorithms ⋮ Self-stabilizing local \(k\)-placement of replicas with local minimum variance

Cites Work

• Unnamed Item
• Unnamed Item
• Distance-\(k\) knowledge in self-stabilizing algorithms
• Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
• A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model
• On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
• An Efficient Self-stabilizing Distance-2 Coloring Algorithm

This page was built for publication: Efficient transformation of distance-2 self-stabilizing algorithms