Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
DOI10.1016/J.IPL.2007.02.013zbMATH Open1184.68612OpenAlexW2131443605MaRDI QIDQ2379950FDOQ2379950
Authors: Volker Turau 
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.02.013
Recommendations
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon
- A self-stabilizing algorithm for constructing weakly connected minimal dominating sets
- Linear-time self-stabilizing algorithms for minimal domination in graphs
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Distributed systems (68M14)
Cites Work
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
- Title not available (Why is that?)
- MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- Distributed Computing - IWDC 2003
Cited In (19)
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
- Efficient transformation of distance-2 self-stabilizing algorithms
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- Self-stabilizing 2-minimal dominating set algorithms based on loop composition
- Fast, silent self-stabilizing distance-\(k\) independent dominating set construction
- Brief announcement: Fully lattice linear algorithms
- Extending Lattice Linearity for Self-stabilizing Algorithms
- A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon
- Title not available (Why is that?)
- A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2
- Resource efficient stabilization for local tasks despite unknown capacity links
- A self-stabilizing algorithm for constructing weakly connected minimal dominating sets
- Distributed Self-Stabilizing MIS with Few States and Weak Communication
- Efficient self-stabilizing algorithm for independent strong dominating sets in arbitrary graphs
- Luby's MIS algorithms made self-stabilizing
- A self-stabilizing 1-maximal independent set algorithm
- Self-stabilizing distributed algorithm for local mutual inclusion
- Self-stabilizing algorithms for unfriendly partitions into two disjoint dominating sets
- Self-Stabilizing Domination Algorithms
This page was built for publication: Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379950)
