Efficient transformation of distance-2 self-stabilizing algorithms
DOI10.1016/J.JPDC.2011.12.008zbMATH Open1242.68366OpenAlexW2000046463MaRDI QIDQ433436FDOQ433436
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
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
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)
Cites Work
- Title not available (Why is that?)
- Distance-\(k\) knowledge in self-stabilizing algorithms
- 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
- A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model
- Title not available (Why is that?)
- An efficient self-stabilizing distance-2 coloring algorithm
Cited In (15)
- 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
- Extending Lattice Linearity for Self-stabilizing Algorithms
- 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 self-stabilizing algorithm for a maximal 2-packing in a cactus graph under any scheduler
- Self-stabilizing local \(k\)-placement of replicas with local minimum variance
- A genetic algorithm for the maximum 2-packing set problem
- Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
- Distance-\(k\) knowledge in self-stabilizing algorithms
- A self-stabilizing algorithm for edge monitoring in wireless sensor networks
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
- Self-stabilizing algorithms for efficient sets of graphs and trees
- Distance-k Information in Self-stabilizing Algorithms
- Self-Stabilizing Domination 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)
