Efficient transformation of distance-2 self-stabilizing algorithms

DOI10.1016/J.JPDC.2011.12.008MaRDI QIDQ433436zbMATH OpenOpenAlexFDO

Authors 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 algorithmsfault-tolerant algorithmsself-stabilization

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2013825
• Distance-\(k\) knowledge in self-stabilizing algorithms
• An efficient self-stabilizing distance-2 coloring algorithm
• An efficient self-stabilizing distance-2 coloring algorithm
• Distance-k Information in Self-stabilizing Algorithms
• A self-stabilizing algorithm for the shortest path problem in a distributed system

Cites work

• A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model
• An efficient self-stabilizing distance-2 coloring algorithm
• Distance-\(k\) knowledge in self-stabilizing algorithms
• scientific article; zbMATH DE number 1696677 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
• On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks

Cited in

(19)

• Algorithm to find a maximum 2-packing set in a cactus
• 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 local k-placement of replicas with local minimum variance
• 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
• Self-Stabilizing Domination Algorithms
• Distance-k Information in Self-stabilizing Algorithms
• Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
• A self-stabilizing algorithm for a maximal 2-packing in a cactus graph under any scheduler
• A self-stabilizing algorithm for edge monitoring in wireless sensor networks
• A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
• Extending Lattice Linearity for Self-stabilizing Algorithms
• k-minimal minus domination and self-stabilization
• Scalable algorithms for 2-packing sets on arbitrary graphs
• Finding maximum weight 2-packing sets on arbitrary graphs
• Being efficient in time, space, and workload: a self-stabilizing unison and its consequences
• Distance-\(k\) knowledge in self-stabilizing algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433436)