Self-Stabilizing Domination Algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2061538
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- Linear-time self-stabilizing algorithms for minimal domination in graphs
- Efficient self-stabilizing algorithm for independent strong dominating sets in arbitrary graphs
- Self-stabilizing algorithm for two disjoint minimal dominating sets
- Self-stabilizing algorithm for minimal dominating set with safe convergence in an arbitrary graph
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
- New self-stabilizing algorithms for minimal weakly connected dominating sets
- Self-stabilizing algorithms for unfriendly partitions into two disjoint dominating sets
- A self-stabilizing algorithm for constructing weakly connected minimal dominating sets
Cites work
- A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon
- A belated proof of self-stabilization
- A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks
- A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2
- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
- A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
- A self-stabilizing 23-approximation algorithm for the maximum matching problem
- A self-stabilizing algorithm for a maximal 2-packing in a cactus graph under any scheduler
- A self-stabilizing algorithm for constructing weakly connected minimal dominating sets
- A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model
- A self-stabilizing algorithm for maximal matching
- A self-stabilizing algorithm for maximal matching in anonymous networks
- A self-stabilizing algorithm for optimally efficient sets in graphs
- A self-stabilizing algorithm to maximal 2-packing with improved complexity
- A self-stabilizing distributed approximation algorithm for the minimum connected dominating set
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets
- An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon for arbitrary networks
- An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon without global identifiers
- An efficient silent self-stabilizing algorithm for 1-maximal matching in anonymous networks
- Distance-\(k\) knowledge in self-stabilizing algorithms
- Distance-k Information in Self-stabilizing Algorithms
- Distributed Computing - IWDC 2003
- Efficient self-stabilizing algorithm for independent strong dominating sets in arbitrary graphs
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
- Efficient transformation of distance-2 self-stabilizing algorithms
- Fast, silent self-stabilizing distance-\(k\) independent dominating set construction
- High Performance Computing - HiPC 2003
- scientific article; zbMATH DE number 4191687 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 1735731 (Why is no real title available?)
- scientific article; zbMATH DE number 2061538 (Why is no real title available?)
- scientific article; zbMATH DE number 2114409 (Why is no real title available?)
- Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
- Linear-time self-stabilizing algorithms for minimal domination in graphs
- Maximal matching stabilizes in quadratic time
- Maximal matching stabilizes in time \(O(m)\)
- Maximum matching for anonymous trees with constant space per process
- New self-stabilizing algorithms for minimal weakly connected dominating sets
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Polynomial self-stabilizing maximum matching algorithm with approximation ratio 2/3
- Self-stabilization
- Self-stabilizing algorithm for minimal dominating set with safe convergence in an arbitrary graph
- Self-stabilizing algorithms for efficient sets of graphs and trees
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
- Self-stabilizing algorithms for unfriendly partitions into two disjoint dominating sets
- Self-stabilizing minimal global offensive alliance algorithm with safe convergence in an arbitrary graph
- Self-stabilizing systems in spite of distributed control
- Unfriendly partitions of a graph
Cited in
(3)
This page was built for publication: Self-Stabilizing Domination Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384122)
