Self-Stabilizing Domination Algorithms
From MaRDI portal
Publication:3384122
DOI10.1007/978-3-030-58892-2_16OpenAlexW3157777419MaRDI QIDQ3384122
Publication date: 14 December 2021
Published in: Developments in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-58892-2_16
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
- A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
- Efficient transformation of distance-2 self-stabilizing algorithms
- A self-stabilizing algorithm to maximal 2-packing with improved complexity
- A self-stabilizing algorithm for optimally efficient sets in graphs
- A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets
- A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem
- A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2
- Unfriendly partitions of a graph
- Distance-\(k\) knowledge in self-stabilizing algorithms
- A self-stabilizing algorithm for constructing weakly connected minimal dominating sets
- A new self-stabilizing maximal matching algorithm
- A belated proof of self-stabilization
- A self-stabilizing algorithm for maximal matching
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Maximal matching stabilizes in quadratic time
- Maximal matching stabilizes in time \(O(m)\)
- An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon without global identifiers
- A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon
- Fast, silent self-stabilizing distance-\(k\) independent dominating set construction
- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
- Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
- 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 finding a minimal 2-dominating set assuming the distributed demon model
- Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs
- Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs
- A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET
- Distance-k Information in Self-stabilizing Algorithms
- Self-stabilizing systems in spite of distributed control
- Self-Stabilizing Algorithm for Minimal Dominating Set with Safe Convergence in an Arbitrary Graph
- A Self-Stabilizing Algorithm for Maximal Matching in Anonymous Networks
- A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler
- An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon for Arbitrary Networks
- An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks
- Distributed Computing - IWDC 2003
- High Performance Computing - HiPC 2003
- New Self-Stabilizing Algorithms for Minimal Weakly Connected Dominating Sets
- Maximum Matching for Anonymous Trees with Constant Space per Process
- 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
This page was built for publication: Self-Stabilizing Domination Algorithms
